Advanced search in
Research products
arrow_drop_down
Searching FieldsTerms
Any field
arrow_drop_down
includes
arrow_drop_down
Include:
31,061 Research products, page 1 of 3,107

  • Publications
  • 2017-2021
  • Open Access
  • Conference object
  • US
  • QA
  • arXiv.org e-Print Archive

10
arrow_drop_down
Relevance
arrow_drop_down
  • Publication . Conference object . Preprint . 2018
    Open Access English
    Authors: 
    Jiajun Zhang; Xiaohui Liang; Zhikun Zhang; Shibo He; Zhiguo Shi;

    Wearable devices enable users to collect health data and share them with healthcare providers for improved health service. Since health data contain privacy-sensitive information, unprotected data release system may result in privacy leakage problem. Most of the existin...

  • Publication . Conference object . Preprint . 2020
    Open Access
    Authors: 
    Ellis Wilson; Sudhakar Singh; Frank Mueller;
    Publisher: IEEE

    Running quantum programs is fraught with challenges on on today's noisy intermediate scale quantum (NISQ) devices. Many of these challenges originate from the error characteristics that stem from rapid decoherence and noise during measurement, qubit connections, crossta...

  • Publication . Preprint . Conference object . 2021
    Open Access English
    Authors: 
    Tainã Coleman; Henri Casanova; Rafael Ferreira da Silva;

    Scientific workflow applications have become mainstream and their automated and efficient execution on large-scale compute platforms is the object of extensive research and development. For these efforts to be successful, a solid experimental methodology is needed to ev...

  • Open Access English
    Authors: 
    Ugo Rosolia; Francesco Braghin; Andrew G. Alleyne; Stijn De Bruyne; Edoardo Sabbioni;

    In this paper a decentralized control algorithm for systems composed of $N$ dynamically decoupled agents, coupled by feasibility constraints, is presented. The control problem is divided into $N$ optimal control sub-problems and a communication scheme is proposed to dec...

  • Open Access English
    Authors: 
    Tao B. Schardl; Siddharth Samsi;

    This work introduces TapirXLA, a replacement for TensorFlow's XLA compiler that embeds recursive fork-join parallelism into XLA's low-level representation of code. Machine-learning applications rely on efficient parallel processing to achieve performance, and they emplo...

  • Open Access English
    Authors: 
    Juraj Juraska; Kevin K. Bowden; Marilyn A. Walker;

    The uptake of deep learning in natural language generation (NLG) led to the release of both small and relatively large parallel corpora for training neural models. The existing data-to-text datasets are, however, aimed at task-oriented dialogue systems, and often thus l...

  • Publication . Preprint . Conference object . 2021
    Open Access English
    Authors: 
    Emily Black; Matt Fredrikson;
    Project: NSF | SaTC: CORE: Large: Collab... (1704845)

    We introduce leave-one-out unfairness, which characterizes how likely a model's prediction for an individual will change due to the inclusion or removal of a single other person in the model's training data. Leave-one-out unfairness appeals to the idea that fair decisio...

  • Publication . Conference object . Preprint . 2018
    Open Access English
    Authors: 
    Antonios Anastasopoulos; David Chiang;
    Project: NSF | RI: Small: Language Induc... (1464553)

    We explore multitask models for neural translation of speech, augmenting them in order to reflect two intuitive notions. First, we introduce a model where the second task decoder receives information from the decoder of the first task, since higher-level intermediate re...

  • Publication . Conference object . Article . Preprint . 2018
    Open Access
    Authors: 
    David Qiu; Anuran Makur; Lizhong Zheng;
    Publisher: IEEE
    Country: United States

    In this paper, we present a local information theoretic approach to explicitly learn probabilistic clustering of a discrete random variable. Our formulation yields a convex maximization problem for which it is NP-hard to find the global optimum. In order to algorithmica...

  • Publication . Conference object . Preprint . 2021
    Open Access English
    Authors: 
    Dong Hu; Shashanka Ubaru; Alex Gittens; Kenneth L. Clarkson; Lior Horesh; Vassilis Kalantzis;

    In recent years, a variety of randomized constructions of sketching matrices have been devised, that have been used in fast algorithms for numerical linear algebra problems, such as least squares regression, low-rank approximation, and the approximation of leverage scor...