197 search results - page 9 / 40 » Simple deterministic approximation algorithms for counting m... |
123
click to vote
ESA
2008
Springer
15 years 3 months ago
2008
Springer
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
106
click to vote
ECCV
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Many computer vision problems such as object segmentation or reconstruction can be formulated in terms of labeling a set of pixels or voxels. In certain scenarios, we may...
PR
2000
15 years 1 months ago
2000
Deterministic annealing and relaxation labeling algorithms for classification and matching are presented and discussed. A new approach--self annealing--is introduced to bring dete...
115
click to vote
FOCS
2007
IEEE
15 years 7 months ago
2007
IEEE
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...
136
click to vote
DC
2008
15 years 1 months ago
2008
We consider a distributed system where each node keeps a local count for items (similar to elections where nodes are ballot boxes and items are candidates). A top-k query in such ...