Sciweavers

2228 search results - page 227 / 446
» Distributed Data Clustering Can Be Efficient and Exact
Sort
View
ECCV
2010
Springer
15 years 11 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
CORR
2010
Springer
94views Education» more  CORR 2010»
15 years 6 months ago
Discovery of Convoys in Trajectory Databases
As mobile devices with positioning capabilities continue to proliferate, data management for so-called trajectory databases that capture the historical movements of populations of...
Hoyoung Jeung, Man Lung Yiu, Xiaofang Zhou, Christ...
CLOUD
2010
ACM
15 years 11 months ago
Robust and flexible power-proportional storage
Power-proportional cluster-based storage is an important component of an overall cloud computing infrastructure. With it, substantial subsets of nodes in the storage cluster can b...
Hrishikesh Amur, James Cipar, Varun Gupta, Gregory...
SIGMOD
2003
ACM
124views Database» more  SIGMOD 2003»
16 years 6 months ago
Dynamic XML documents with distribution and replication
The advent of XML as a universal exchange format, and of Web services as a basis for distributed computing, has fostered the apparition of a new class of documents: dynamic XML do...
Serge Abiteboul, Angela Bonifati, Gregory Cobena, ...
IPPS
2007
IEEE
16 years 26 days ago
Nonuniformly Communicating Noncontiguous Data: A Case Study with PETSc and MPI
Due to the complexity associated with developing parallel applications, scientists and engineers rely on highlevel software libraries such as PETSc, ScaLAPACK and PESSL to ease th...
Pavan Balaji, Darius Buntinas, Satish Balay, Barry...