4047 search results - page 258 / 810 » The Discrete Basis Problem |
134
click to vote
COCOA
2008
Springer
15 years 6 months ago
2008
Springer
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...
127
click to vote
COLT
2008
Springer
15 years 6 months ago
2008
Springer
We study the problem of clustering discrete probability distributions with respect to the Kullback-Leibler (KL) divergence. This problem arises naturally in many applications. Our...
140
click to vote
COMPGEOM
2008
ACM
15 years 6 months ago
2008
ACM
This video illustrates an algorithm for computing a maximum number of disjoint paths for unit disks moving among a set of dynamic obstacles in the plane. The problem is motivated ...
150
click to vote
COMPGEOM
2008
ACM
15 years 6 months ago
2008
ACM
Pattern matching in point sets is a well studied problem with numerous applications. We assume that the point sets may contain outliers (missing or spurious points) and are subjec...
248
click to vote
COMPGEOM
2011
ACM
14 years 8 months ago
2011
ACM
We propose a framework for compressive sensing of images with local geometric features. Specifically, let x ∈ RN be an N-pixel image, where each pixel p has value xp. The image...