501 search results - page 58 / 101 » Rough Sets and Approximation Schemes |
120
Voted
ICALP
2010
Springer
15 years 5 months ago
2010
Springer
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
100
Voted
NIPS
2001
15 years 2 months ago
2001
We present a principled and efficient planning algorithm for cooperative multiagent dynamic systems. A striking feature of our method is that the coordination and communication be...
130
click to vote
AAAI
2010
15 years 2 months ago
2010
Mini-Bucket Elimination (MBE) is a well-known approximation algorithm deriving lower and upper bounds on quantities of interest over graphical models. It relies on a procedure tha...
113
Voted
SODA
2004
ACM
15 years 2 months ago
2004
ACM
We introduce the Bloomier filter, a data structure for compactly encoding a function with static support in order to support approximate evaluation queries. Our construction gener...
CORR
2008
Springer
15 years 24 days ago
2008
Springer
In many important problems, one uses the median instead of the mean to estimate a population's center, since the former is more robust. But in general, computing the median i...