Sciweavers

3652 search results - page 342 / 731
» A study of query length
Sort
View
STOC
2006
ACM
166views Algorithms» more  STOC 2006»
16 years 4 months ago
New upper and lower bounds for randomized and quantum local search
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
Shengyu Zhang
STOC
2003
ACM
102views Algorithms» more  STOC 2003»
16 years 4 months ago
Some 3CNF properties are hard to test
For a Boolean formula on n variables, the associated property P is the collection of n-bit strings that satisfy . We study the query complexity of tests that distinguish (with hig...
Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodniko...
SIGMOD
2006
ACM
124views Database» more  SIGMOD 2006»
16 years 4 months ago
Redundancy and information leakage in fine-grained access control
The current SQL standard for access control is coarse grained, in that it grants access to all rows of a table or none. Fine-grained access control, which allows control of access...
Govind Kabra, Ravishankar Ramamurthy, S. Sudarshan
SIGMOD
2004
ACM
161views Database» more  SIGMOD 2004»
16 years 4 months ago
Approximation Techniques for Spatial Data
Spatial Database Management Systems (SDBMS), e.g., Geographical Information Systems, that manage spatial objects such as points, lines, and hyper-rectangles, often have very high ...
Abhinandan Das, Johannes Gehrke, Mirek Riedewald
SIGMOD
2004
ACM
157views Database» more  SIGMOD 2004»
16 years 4 months ago
Holistic UDAFs at streaming speeds
Many algorithms have been proposed to approximate holistic aggregates, such as quantiles and heavy hitters, over data streams. However, little work has been done to explore what t...
Graham Cormode, Theodore Johnson, Flip Korn, S. Mu...