Sciweavers

151 search results - page 27 / 31
» Rearranging data objects for efficient and stable clustering
Sort
View
92
Voted
IPPS
2005
IEEE
15 years 5 months ago
Fault-Tolerant Parallel Applications with Dynamic Parallel Schedules
Commodity computer clusters are often composed of hundreds of computing nodes. These generally off-the-shelf systems are not designed for high reliability. Node failures therefore...
Sebastian Gerlach, Roger D. Hersch
CVPR
2006
IEEE
16 years 1 months ago
3D Surface Matching and Recognition Using Conformal Geometry
3D surface matching is a fundamental issue in computer vision with many applications such as shape registration, 3D object recognition and classification. However, surface matchin...
Sen Wang, Yang Wang, Miao Jin, Xianfeng Gu, Dimitr...
178
Voted
SIGMOD
2009
ACM
140views Database» more  SIGMOD 2009»
15 years 12 months ago
Distributed data-parallel computing using a high-level programming language
The Dryad and DryadLINQ systems offer a new programming model for large scale data-parallel computing. They generalize previous execution environments such as SQL and MapReduce in...
Michael Isard, Yuan Yu
ICDE
2007
IEEE
106views Database» more  ICDE 2007»
15 years 6 months ago
Mining Trajectory Databases via a Suite of Distance Operators
With the rapid progress of mobile devices and positioning technologies, Trajectory Databases (TD) have been in the core of database research during the last decade. Analysis and k...
Nikos Pelekis, Ioannis Kopanakis, Irene Ntoutsi, G...
ECCV
2010
Springer
15 years 4 months ago
Fast Approximate Nearest Neighbor Methods for Non-Euclidean Manifolds with Applications to Human Activity Analysis in Videos
Approximate Nearest Neighbor (ANN) methods such as Locality Sensitive Hashing, Semantic Hashing, and Spectral Hashing, provide computationally ecient procedures for nding objects...
Rizwan Chaudhry, Yuri Ivanov