Sciweavers

14704 search results - page 2787 / 2941
» computing 2007
Sort
View
246
Voted
POPL
2007
ACM
16 years 3 months ago
Program verification as probabilistic inference
In this paper, we propose a new algorithm for proving the validity or invalidity of a pre/postcondition pair for a program. The algorithm is motivated by the success of the algori...
Sumit Gulwani, Nebojsa Jojic
122
Voted
STOC
2007
ACM
83views Algorithms» more  STOC 2007»
16 years 3 months ago
Lattices that admit logarithmic worst-case to average-case connection factors
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...
Chris Peikert, Alon Rosen
158
Voted
STOC
2007
ACM
142views Algorithms» more  STOC 2007»
16 years 3 months ago
Lower bounds for randomized read/write stream algorithms
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...
Paul Beame, T. S. Jayram, Atri Rudra
128
Voted
STOC
2007
ACM
100views Algorithms» more  STOC 2007»
16 years 3 months ago
Reordering buffers for general metric spaces
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
Matthias Englert, Harald Räcke, Matthias West...
217
Voted
VLDB
2007
ACM
166views Database» more  VLDB 2007»
16 years 3 months ago
Supporting Time-Constrained SQL Queries in Oracle
The growing nature of databases, and the flexibility inherent in the SQL query language that allows arbitrarily complex formulations, can result in queries that take inordinate am...
Ying Hu, Seema Sundara, Jagannathan Srinivasan
« Prev « First page 2787 / 2941 Last » Next »