Sciweavers

1279 search results - page 69 / 256
» Approximation Algorithms for Min-Max Generalization Problems
Sort
View
ESA
2007
Springer
97views Algorithms» more  ESA 2007»
14 years 3 months ago
To Fill or Not to Fill: The Gas Station Problem
In this paper we study several routing problems that generalize shortest paths and the Traveling Salesman Problem. We consider a more general model that incorporates the actual co...
Samir Khuller, Azarakhsh Malekian, Julián M...
COMPGEOM
2010
ACM
14 years 1 months ago
Approximating loops in a shortest homology basis from point data
Inference of topological and geometric attributes of a hidden manifold from its point data is a fundamental problem arising in many scientific studies and engineering application...
Tamal K. Dey, Jian Sun, Yusu Wang
CVPR
2004
IEEE
14 years 10 months ago
Incremental Density Approximation and Kernel-Based Bayesian Filtering for Object Tracking
Statistical density estimation techniques are used in many computer vision applications such as object tracking, background subtraction, motion estimation and segmentation. The pa...
Bohyung Han, Dorin Comaniciu, Ying Zhu, Larry S. D...
ICALP
2011
Springer
13 years 7 days ago
Clique Clustering Yields a PTAS for max-Coloring Interval Graphs
We are given an interval graph G = (V, E) where each interval I ∈ V has a weight wI ∈ R+. The goal is to color the intervals V with an arbitrary number of color classes C1, C2...
Tim Nonner
STOC
2006
ACM
244views Algorithms» more  STOC 2006»
14 years 9 months ago
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
We introduce a new low-distortion embedding of d 2 into O(log n) p (p = 1, 2), called the Fast-Johnson-LindenstraussTransform. The FJLT is faster than standard random projections ...
Nir Ailon, Bernard Chazelle