5169 search results - page 77 / 1034 » Locality approximation using time |
137
Voted
COLT
2010
Springer
15 years 15 days ago
2010
Springer
A significant Fourier transform (SFT) algorithm, given a threshold and oracle access to a function f, outputs (the frequencies and approximate values of) all the -significant Fou...
128
click to vote
ICN
2005
Springer
15 years 8 months ago
2005
Springer
Input Queued switches have been very well studied in the recent past. The Maximum Weight Matching (MWM) algorithm is known to deliver 100% throughput under any admissible traffic. ...
189
click to vote
VLDB
2001
ACM
16 years 2 months ago
2001
ACM
Approximate query processing has emerged as a costeffective approach for dealing with the huge data volumes and stringent response-time requirements of today's decision-suppo...
123
click to vote
JMLR
2010
14 years 9 months ago
2010
We consider the problem of correcting the posterior marginal approximations computed by expectation propagation and Laplace approximation in latent Gaussian models and propose cor...
117
click to vote
CDC
2010
IEEE
14 years 9 months ago
2010
IEEE
s using Approximately Bisimilar Abstractions: Time-Optimal Control Problems Antoine Girard In this paper, we present a hierarchical approach to time-optimal control using approxima...