Sciweavers

2826 search results - page 106 / 566
» Maximal Vector Computation in Large Data Sets
Sort
View
VLDB
1997
ACM
170views Database» more  VLDB 1997»
14 years 24 days ago
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
A new access method, called M-tree, is proposed to organize and search large data sets from a generic "metric space", i.e. where object proximity is only defined by a di...
Paolo Ciaccia, Marco Patella, Pavel Zezula
ICMLA
2008
13 years 10 months ago
Graph-Based Multilevel Dimensionality Reduction with Applications to Eigenfaces and Latent Semantic Indexing
Dimension reduction techniques have been successfully applied to face recognition and text information retrieval. The process can be time-consuming when the data set is large. Thi...
Sophia Sakellaridi, Haw-ren Fang, Yousef Saad
ICCV
2001
IEEE
14 years 11 months ago
Calibration with Robust Use of Cheirality by Quasi-Affine Reconstruction of the Set of Camera Projection Centres
A methodfor upgrading a projective reconstruction to metric is presented. The reconstruction is first transformed by considering cheirality so that the convex hull of the set of c...
David Nistér
JCST
2010
147views more  JCST 2010»
13 years 7 months ago
Volumetric Vector-Based Representation for Indirect Illumination Caching
Abstract This paper introduces a caching technique based on a volumetric representation that captures low-frequency indirect illumination. This structure is intended for efficient ...
Romain Pacanowski, Xavier Granier, Christophe Schl...
ICS
2007
Tsinghua U.
14 years 3 months ago
Performance driven data cache prefetching in a dynamic software optimization system
Software or hardware data cache prefetching is an efficient way to hide cache miss latency. However effectiveness of the issued prefetches have to be monitored in order to maximi...
Jean Christophe Beyler, Philippe Clauss