Sciweavers

7129 search results - page 239 / 1426
» Approximation Algorithms for Treewidth
Sort
View
SIGMOD
2009
ACM
155views Database» more  SIGMOD 2009»
16 years 4 months ago
Efficient top-k algorithms for fuzzy search in string collections
An approximate search query on a collection of strings finds those strings in the collection that are similar to a given query string, where similarity is defined using a given si...
Rares Vernica, Chen Li
SSS
2009
Springer
162views Control Systems» more  SSS 2009»
15 years 10 months ago
Distributed Sleep Scheduling in Wireless Sensor Networks via Fractional Domatic Partitioning
We consider setting up sleep scheduling in sensor networks. We formulate the problem as an instance of the fractional domatic partition problem and obtain a distributed approximati...
André Schumacher, Harri Haanpää
SODA
2003
ACM
126views Algorithms» more  SODA 2003»
15 years 5 months ago
Smaller core-sets for balls
We prove the existence of small core-sets for solving approximate k-center clustering and related problems. The size of these core-sets is considerably smaller than the previously...
Mihai Badoiu, Kenneth L. Clarkson
148
Voted
APPROX
2008
Springer
142views Algorithms» more  APPROX 2008»
15 years 6 months ago
Approximating Maximum Subgraphs without Short Cycles
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...
Guy Kortsarz, Michael Langberg, Zeev Nutov
ICML
2009
IEEE
15 years 11 months ago
Split variational inference
We propose a deterministic method to evaluate the integral of a positive function based on soft-binning functions that smoothly cut the integral into smaller integrals that are ea...
Guillaume Bouchard, Onno Zoeter