Sciweavers

143 search results - page 6 / 29
» Quick Approximation to Matrices and Applications
Sort
View
ICML
2009
IEEE
14 years 8 months ago
On sampling-based approximate spectral decomposition
This paper addresses the problem of approximate singular value decomposition of large dense matrices that arises naturally in many machine learning applications. We discuss two re...
Sanjiv Kumar, Mehryar Mohri, Ameet Talwalkar
SDM
2008
SIAM
147views Data Mining» more  SDM 2008»
13 years 9 months ago
The Asymmetric Approximate Anytime Join: A New Primitive with Applications to Data Mining
It has long been noted that many data mining algorithms can be built on top of join algorithms. This has lead to a wealth of recent work on efficiently supporting such joins with ...
Lexiang Ye, Xiaoyue Wang, Dragomir Yankov, Eamonn ...
ICPR
2010
IEEE
14 years 17 days ago
Object Tracking by Structure Tensor Analysis
Covariance matrices have recently been a popular choice for versatile tasks like recognition and tracking due to their powerful properties as local descriptor and their low comput...
Michael Donoser, Stefan Kluckner, Horst Bischof
DKE
2008
96views more  DKE 2008»
13 years 7 months ago
Fragment-based approximate retrieval in highly heterogeneous XML collections
Due to the heterogeneous nature of XML data for internet applications exact matching of queries is often inadequate. The need arises to quickly identify subtrees of XML documents ...
Ismael Sanz, Marco Mesiti, Giovanna Guerrini, Rafa...
ICCV
1995
IEEE
13 years 11 months ago
Estimating the Tensor of Curvature of a Surface from a Polyhedral Approximation
Estimating principal curvatures and principal directions of a surface from a polyhedral approximation with a large number of small faces, such as those produced by iso-surface con...
Gabriel Taubin