2168 search results - page 69 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
117
Voted
FOCS
2006
IEEE
15 years 9 months ago
2006
IEEE
We present an algorithm for the c-approximate nearest neighbor problem in a d-dimensional Euclidean space, achieving query time of O(dn1/c2 +o(1) ) and space O(dn + n1+1/c2 +o(1) ...
128
click to vote
ICDT
2001
ACM
15 years 8 months ago
2001
ACM
In fast OLAP applications it is often advantageous to provide approximate answers to range queries in order to achieve very high performances. A possible solution is to inquire sum...
146
Voted
DMSN
2004
ACM
15 years 9 months ago
2004
ACM
Recent work in sensor databases has focused extensively on distributed query problems, notably distributed computation of aggregates. Existing methods for computing aggregates bro...
132
Voted
EOR
2007
15 years 3 months ago
2007
A simultaneous perturbation stochastic approximation (SPSA) method has been developed in this paper, using the operators of perturbation with the Lipschitz density function. This ...
148
Voted
NIPS
2004
15 years 4 months ago
2004
We consider an MDP setting in which the reward function is allowed to change during each time step of play (possibly in an adversarial manner), yet the dynamics remain fixed. Simi...