Results 1  10
of
782,339
Oblivious Transfer and nVariate Linear Function Evaluation
"... Abstract. We define a new cryptographic primitive which is called Oblivious nvariate Linear Function Evaluation with choice space C and denoted by COLFEn. The primitive captures a variety of wellknown cryptographic primitives and is an interesting stepstone in secure protocol design. We present ..."
Abstract
 Add to MetaCart
Abstract. We define a new cryptographic primitive which is called Oblivious nvariate Linear Function Evaluation with choice space C and denoted by COLFEn. The primitive captures a variety of wellknown cryptographic primitives and is an interesting stepstone in secure protocol design. We present
Optimizing nvariate (n+k)nomials for small k
, 2010
"... We give a high precision polynomialtime approximation scheme for the supremum of any honest nvariate (n + 2)nomial with a constant term, allowing real exponents as well as real coefficients. Our complexity bounds count field operations and inequality checks, and are quadratic in n and the logarit ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We give a high precision polynomialtime approximation scheme for the supremum of any honest nvariate (n + 2)nomial with a constant term, allowing real exponents as well as real coefficients. Our complexity bounds count field operations and inequality checks, and are quadratic in n
Optimizing nvariate (n + k)nomials for small k
, 2010
"... We give a high precision polynomialtime approximation scheme for the supremum of any honest nvariate (n+2)nomial with a constant term, allowing real exponents as well as real coefficients. Our complexity bounds count field operations and inequality checks, and are polynomial in n and the logarith ..."
Abstract
 Add to MetaCart
We give a high precision polynomialtime approximation scheme for the supremum of any honest nvariate (n+2)nomial with a constant term, allowing real exponents as well as real coefficients. Our complexity bounds count field operations and inequality checks, and are polynomial in n
Performance persistence
 Journal of Finance
, 1995
"... Most optimizationbased decision support systems are used repeatedly with only modest changes to input data from scenario to scenario. Unfortunately, optimization (mathematical programming) has a welldeserved reputation for amplifying small input changes into drastically different solutions. A prev ..."
Abstract

Cited by 324 (12 self)
 Add to MetaCart
Most optimizationbased decision support systems are used repeatedly with only modest changes to input data from scenario to scenario. Unfortunately, optimization (mathematical programming) has a welldeserved reputation for amplifying small input changes into drastically different solutions. A
Learning polynomials with queries: The highly noisy case
, 1995
"... Given a function f mapping nvariate inputs from a finite Kearns et. al. [21] (see also [27, 28, 22]). In the setting of agfieldFintoF, we consider the task of reconstructing a list nostic learning, the learner is to make no assumptions regarding of allnvariate degreedpolynomials which agree withf ..."
Abstract

Cited by 97 (17 self)
 Add to MetaCart
Given a function f mapping nvariate inputs from a finite Kearns et. al. [21] (see also [27, 28, 22]). In the setting of agfieldFintoF, we consider the task of reconstructing a list nostic learning, the learner is to make no assumptions regarding of allnvariate degreedpolynomials which agree
A Comparison of Dynamic Branch Predictors that use Two Levels of Branch History
 in Proceedings of the 20th Annual International Symposium on Computer Architecture
, 1993
"... Recent attention to speculative execution as a mechanism for increasing performance of single instruction streams has demanded substantially better branch prediction than what has been previously available. We [1, 2] and Pan, So, and Rahmeh [4] have both proposed variations of the same aggressive dy ..."
Abstract

Cited by 279 (9 self)
 Add to MetaCart
Recent attention to speculative execution as a mechanism for increasing performance of single instruction streams has demanded substantially better branch prediction than what has been previously available. We [1, 2] and Pan, So, and Rahmeh [4] have both proposed variations of the same aggressive
Objects and Views
 ACM SIGMOD INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA
, 1991
"... Objectoriented databases have been introduced primarily to ease the development of database applications. However, the difficulties encountered when, for instance, trying to restructure data or integrate databases demonstrate that the models being used still lack flexibility. We claim that the natu ..."
Abstract

Cited by 258 (9 self)
 Add to MetaCart
Objectoriented databases have been introduced primarily to ease the development of database applications. However, the difficulties encountered when, for instance, trying to restructure data or integrate databases demonstrate that the models being used still lack flexibility. We claim that the natural way to overcome these shortcomings is to introduce a sophisticated view mechanism. This paper presents such a mechanism, one which allows a programmer to restructure the class hierarchy and modify the behavior and structure of objects. The mechanism allows a programmer to specify attribute values implicitly, rather than storing them. It also allows him to introduce new classes into the class hierarchy. These virtual classes are populated by selecting existing objects from other classes and by creating new objects. Fixing the identify of new objects during database updates introduces subtle issues into view design. Our presentation, mostly informal, leans on a number of illustrative examples meant to emphasize the simplicity of our mechanism. 1
Integration and synchronization of input modes during multimodal humancomputer interaction
, 1997
"... Our ability to develop robust multimodal systems will depend on knowledge of the natural integration patterns that typify people’s combined use of different input modes. To provide a foundadon for theory and design, the present research analyzed multimodal interaction while people spoke and wrote to ..."
Abstract

Cited by 175 (20 self)
 Add to MetaCart
Our ability to develop robust multimodal systems will depend on knowledge of the natural integration patterns that typify people’s combined use of different input modes. To provide a foundadon for theory and design, the present research analyzed multimodal interaction while people spoke and wrote
Inputs
"... Abstract — We consider the fundamental delay bounds for scheduling packets in an N ×N packet switch operating under the crossbar constraint. Algorithms that make scheduling decisions without considering queue backlog are shown to incur an average delay of at least O(N). We then prove that O(log(N)) ..."
Abstract
 Add to MetaCart
Abstract — We consider the fundamental delay bounds for scheduling packets in an N ×N packet switch operating under the crossbar constraint. Algorithms that make scheduling decisions without considering queue backlog are shown to incur an average delay of at least O(N). We then prove that O(log(N
Results 1  10
of
782,339