9716 search results - page 304 / 1944 » The Case for Energy-Proportional Computing |
184
click to vote
DAM
2007
15 years 6 months ago
2007
Given A := {a1, . . . , am} ⊂ Rd whose affine hull is Rd, we study the problems of computing an approximate rounding of the convex hull of A and an approximation to the minimum ...
170
click to vote
ECCV
2000
Springer
16 years 8 months ago
2000
Springer
Abstract. Recent human vision research [1] suggests modelling preattentive texture segmentation by taking a set of feature samples from a local region on each side of a hypothesize...
192
click to vote
TCC
2009
Springer
16 years 7 months ago
2009
Springer
We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks. Focusing mainly on the case o...
182
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
We show how to securely realize any multi-party functionality in a way that preserves security under an a-priori bounded number of concurrent executions, regardless of the number ...
185
click to vote
STACS
2009
Springer
16 years 1 months ago
2009
Springer
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic-programming s...