315 search results - page 12 / 63 » Algebraic Lower Bounds for Computing on Encrypted Data |
85
Voted
EUROPAR
1995
Springer
15 years 4 months ago
1995
Springer
The growing disparity between processor and memory speeds has caused memory bandwidth to become the performance bottleneck for many applications. In particular, this performance ga...
119
Voted
ICPR
2010
IEEE
15 years 7 months ago
2010
IEEE
We consider the problem of classification in nonadaptive dimensionality reduction. Specifically, we bound the increase in classification error of Fisher’s Linear Discriminant...
101
Voted
FCT
2005
Springer
15 years 6 months ago
2005
Springer
We review a recently introduced computation model for streaming and external memory data. An important feature of this model is that it distinguishes between sequentially reading (...
85
Voted
GD
2009
Springer
14 years 10 months ago
2009
Springer
Abstract. The study of (minimally) rigid graphs is motivated by numerous applications, mostly in robotics and bioinformatics. A major open problem concerns the number of embeddings...
132
click to vote
LICS
2012
IEEE
13 years 2 months ago
2012
IEEE
—We show how to reliably compute fast-growing functions with timed-arc Petri nets and data nets. This construction provides ordinal-recursive lower bounds on the complexity of th...