Sciweavers

274 search results - page 45 / 55
» Approximating Edit Distance Efficiently
Sort
View
APPROX
2008
Springer
83views Algorithms» more  APPROX 2008»
13 years 12 months ago
Sampling Hypersurfaces through Diffusion
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 ...
Hariharan Narayanan, Partha Niyogi
VLDB
2008
ACM
147views Database» more  VLDB 2008»
14 years 10 months ago
Tree-based partition querying: a methodology for computing medoids in large spatial datasets
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...
Kyriakos Mouratidis, Dimitris Papadias, Spiros Pap...
MOBIHOC
2005
ACM
14 years 9 months ago
Localization and routing in sensor networks by local angle information
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...
Jehoshua Bruck, Jie Gao, Anxiao Jiang
TITB
2010
167views Education» more  TITB 2010»
13 years 4 months ago
Structural action recognition in body sensor networks: distributed classification based on string matching
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...
Hassan Ghasemzadeh, Vitali Loseu, Roozbeh Jafari
CVPR
2007
IEEE
14 years 12 months ago
Element Rearrangement for Tensor-Based Subspace Learning
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 ...
Shuicheng Yan, Dong Xu, Stephen Lin, Thomas S. Hua...