Sciweavers

3874 search results - page 254 / 775
» Approximation Algorithms for k-hurdle Problems
Sort
View
STOC
2003
ACM
153views Algorithms» more  STOC 2003»
16 years 4 months ago
Sublinear geometric algorithms
We initiate an investigation of sublinear algorithms for geometric problems in two and three dimensions. We give optimal algorithms for intersection detection of convex polygons a...
Bernard Chazelle, Ding Liu, Avner Magen
NIPS
2001
15 years 5 months ago
The Unified Propagation and Scaling Algorithm
In this paper we will show that a restricted class of constrained minimum divergence problems, named generalized inference problems, can be solved by approximating the KL divergen...
Yee Whye Teh, Max Welling
95
Voted
CCCG
2010
15 years 5 months ago
Constrained k-center and movement to independence
We obtain hardness results and approximation algorithms for two related geometric problems involving movement. The first is a constrained variant of the k-center problem, arising ...
Adrian Dumitrescu, Minghui Jiang
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
16 years 4 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
BIOINFORMATICS
2011
14 years 11 months ago
Algorithms for sorting unsigned linear genomes by the DCJ operations
Motivation: The double cut and join operation (abbreviated as DCJ) has been extensively used for genomic rearrangement. Although the DCJ distance between signed genomes with both ...
Haitao Jiang, Binhai Zhu, Daming Zhu