Sciweavers

155 search results - page 12 / 31
» Fast matrix rank algorithms and applications
Sort
View
ICDE
2009
IEEE
159views Database» more  ICDE 2009»
15 years 4 months ago
ApproxRank: Estimating Rank for a Subgraph
Abstract— Customized semantic query answering, personalized search, focused crawlers and localized search engines frequently focus on ranking the pages contained within a subgrap...
Yao Wu, Louiqa Raschid
EDBT
2010
ACM
246views Database» more  EDBT 2010»
15 years 4 months ago
Fast computation of SimRank for static and dynamic information networks
Information networks are ubiquitous in many applications and analysis on such networks has attracted significant attention in the academic communities. One of the most important ...
Cuiping Li, Jiawei Han, Guoming He, Xin Jin, Yizho...
ICML
2005
IEEE
15 years 10 months ago
Predictive low-rank decomposition for kernel methods
Low-rank matrix decompositions are essential tools in the application of kernel methods to large-scale learning problems. These decompositions have generally been treated as black...
Francis R. Bach, Michael I. Jordan
IJCAI
2007
14 years 11 months ago
Fast Incremental Square Root Information Smoothing
We propose a novel approach to the problem of simultaneous localization and mapping (SLAM) based on incremental smoothing, that is suitable for real-time applications in large-sca...
Michael Kaess, Ananth Ranganathan, Frank Dellaert
ICML
2005
IEEE
15 years 10 months ago
Non-negative tensor factorization with applications to statistics and computer vision
We derive algorithms for finding a nonnegative n-dimensional tensor factorization (n-NTF) which includes the non-negative matrix factorization (NMF) as a particular case when n = ...
Amnon Shashua, Tamir Hazan