12183 search results - page 2176 / 2437 » Computers under Attacks! |
170
click to vote
STOC
2007
ACM
16 years 7 months ago
2007
ACM
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
183
click to vote
STOC
2006
ACM
16 years 7 months ago
2006
ACM
In this paper we consider bounded real-valued functions over the discrete cube, f : {-1, 1}n [-1, 1]. Such functions arise naturally in theoretical computer science, combinatorics...
260
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
A method for approximate subsequence matching is introduced, that significantly improves the efficiency of subsequence matching in large time series data sets under the dynamic ti...
192
click to vote
SIGMOD
2003
ACM
16 years 6 months ago
2003
ACM
Most relational query optimizers make use of information about the costs of accessing tuples and data structures on various storage devices. This information can at times be off b...
186
click to vote
EDBT
2004
ACM
16 years 6 months ago
2004
ACM
GRID technology, emerging in the late nineties, has evolved from a metacomputing architecture towards a pervasive computation and information utility. However, the architectural de...