316 search results - page 19 / 64 » Approximation algorithms for hierarchical location problems |
120
click to vote
ICCV
2009
IEEE
16 years 6 months ago
2009
IEEE
Subspace segmentation is the task of segmenting data
lying on multiple linear subspaces. Its applications in
computer vision include motion segmentation in video,
structure-from...
164
Voted
CPM
1998
Springer
15 years 6 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
129
Voted
DCOSS
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We consider the problem of estimating the locations of mobile agents by fusing the measurements of displacements of the agents as well as relative position measurements b...
132
Voted
SODA
2010
ACM
15 years 11 months ago
2010
ACM
In the capacitated vehicle routing problem, introduced by Dantzig and Ramser in 1959, we are given the locations of n customers and a depot, along with a vehicle of capacity k, an...
89
Voted
GLOBECOM
2006
IEEE
15 years 8 months ago
2006
IEEE
—Distributed Denial of Service attacks have recently emerged as one of the most potent, if not the greatest, weaknesses of the Internet. Previous solutions for this problem try t...