Sciweavers

2826 search results - page 63 / 566
» Maximal Vector Computation in Large Data Sets
Sort
View
CIKM
2000
Springer
15 years 8 months ago
Dimensionality Reduction and Similarity Computation by Inner Product Approximations
—As databases increasingly integrate different types of information such as multimedia, spatial, time-series, and scientific data, it becomes necessary to support efficient retri...
Ömer Egecioglu, Hakan Ferhatosmanoglu
TIFS
2010
82views more  TIFS 2010»
15 years 2 months ago
Lossless data embedding in electronic inks
—This paper presents a novel lossless data embedding algorithm for electronic inks. The proposed algorithm first computes the analytical ink-curve for each stroke as a set of sm...
Hong Cao, Alex C. Kot
GIS
2004
ACM
16 years 5 months ago
Efficient detection of motion patterns in spatio-temporal data sets
Moving point object data can be analyzed through the discovery of patterns. We consider the computational efficiency of detecting four such spatio-temporal patterns, namely flock,...
Joachim Gudmundsson, Marc J. van Kreveld, Bettina ...
ICDE
1999
IEEE
139views Database» more  ICDE 1999»
16 years 5 months ago
Clustering Large Datasets in Arbitrary Metric Spaces
Clustering partitions a collection of objects into groups called clusters, such that similar objects fall into the same group. Similarity between objects is defined by a distance ...
Venkatesh Ganti, Raghu Ramakrishnan, Johannes Gehr...
ICASSP
2011
IEEE
14 years 7 months ago
Basis Pursuit in sensor networks
Basis Pursuit (BP) finds a minimum ℓ1-norm vector z that satisfies the underdetermined linear system Mz = b, where the matrix M and vector b are given. Lately, BP has attracte...
João F. C. Mota, João M. F. Xavier, ...