274 search results - page 45 / 55 » Approximating Edit Distance Efficiently |
APPROX
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. We are interested in efficient algorithms for generating random samples from geometric objects such as Riemannian manifolds. As a step in this direction, we consider the ...
183
click to vote
VLDB
2008
ACM
16 years 20 days ago
2008
ACM
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous e...
109
Voted
MOBIHOC
2005
ACM
16 years 1 days ago
2005
ACM
Location information is very useful in the design of sensor network infrastructures. In this paper, we study the anchor-free 2D localization problem by using local angle measureme...
152
Voted
TITB
2010
14 years 7 months ago
2010
Mobile sensor-based systems are emerging as promising platforms for healthcare monitoring. An important goal of these systems is to extract physiological information about the subj...
95
Voted
CVPR
2007
IEEE
16 years 2 months ago
2007
IEEE
The success of tensor-based subspace learning depends heavily on reducing correlations along the column vectors of the mode-k flattened matrix. In this work, we study the problem ...