Sciweavers

7129 search results - page 318 / 1426
» Approximation Algorithms for Treewidth
Sort
View
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
16 years 5 months ago
Searching dynamic point sets in spaces with bounded doubling dimension
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
Richard Cole, Lee-Ad Gottlieb
SODA
2007
ACM
145views Algorithms» more  SODA 2007»
15 years 6 months ago
Aggregation of partial rankings, p-ratings and top-m lists
We study the problem of aggregating partial rankings. This problem is motivated by applications such as meta-searching and information retrieval, search engine spam fighting, e-c...
Nir Ailon
GECCO
2008
Springer
123views Optimization» more  GECCO 2008»
15 years 5 months ago
Hierarchical evolution of linear regressors
We propose an algorithm for function approximation that evolves a set of hierarchical piece-wise linear regressors. The algorithm, named HIRE-Lin, follows the iterative rule learn...
Francesc Teixidó-Navarro, Albert Orriols-Pu...
COMGEO
1999
ACM
15 years 4 months ago
Optimal triangulation and quadric-based surface simplification
Many algorithms for reducing the number of triangles in a surface model have been proposed, but to date there has been little theoretical analysis of the approximations they produ...
Paul S. Heckbert, Michael Garland
ICML
2004
IEEE
16 years 5 months ago
Approximate inference by Markov chains on union spaces
A standard method for approximating averages in probabilistic models is to construct a Markov chain in the product space of the random variables with the desired equilibrium distr...
Max Welling, Michal Rosen-Zvi, Yee Whye Teh