Sciweavers

4541 search results - page 447 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
NIPS
2001
15 years 6 months ago
Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering
Drawing on the correspondence between the graph Laplacian, the Laplace-Beltrami operator on a manifold, and the connections to the heat equation, we propose a geometrically motiva...
Mikhail Belkin, Partha Niyogi
KDD
2007
ACM
244views Data Mining» more  KDD 2007»
16 years 5 months ago
A Recommender System Based on Local Random Walks and Spectral Methods
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
Zeinab Abbassi, Vahab S. Mirrokni
ICDT
2012
ACM
251views Database» more  ICDT 2012»
13 years 7 months ago
Computing universal models under guarded TGDs
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
André Hernich
ICIP
2006
IEEE
16 years 6 months ago
Prioritized Sequential 3D Reconstruction in Video Sequences with Multiple Motions
In this study, an algorithm is proposed to solve the multi-frame structure from motion (MFSfM) problem for monocular video sequences in dynamic scenes. The algorithm uses the epip...
Evren Imre, Sebastian Knorr, A. Aydin Alatan, Thom...
SDM
2009
SIAM
167views Data Mining» more  SDM 2009»
16 years 2 months ago
Detecting Communities in Social Networks Using Max-Min Modularity.
Many datasets can be described in the form of graphs or networks where nodes in the graph represent entities and edges represent relationships between pairs of entities. A common ...
Jiyang Chen, Osmar R. Zaïane, Randy Goebel