3368 search results - page 86 / 674 » The Complexity of Query Reliability |
ICALP
2004
Springer
14 years 2 months ago
2004
Springer
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
EMSOFT
2007
Springer
14 years 3 months ago
2007
Springer
Design space exploration of embedded systems typically focuses on classical design goals such as cost, timing, buffer sizes, and power consumption. Robustness criteria, i.e. sensi...
STOC
2012
ACM
11 years 11 months ago
2012
ACM
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...
PVLDB
2010
13 years 7 months ago
2010
Virtual views are a mechanism that facilitates re-use and makes queries easier to express. However the use of iterative view definitions makes very simple query evaluation and an...
ICSE
2005
IEEE-ACM
14 years 9 months ago
2005
IEEE-ACM
AGENDA is a tool set for testing relational database applications. An earlier prototype was targeted to applications consisting of a single query and included components for popul...