Sciweavers

3096 search results - page 346 / 620
» Theory and Use of the EM Algorithm
Sort
View
WSDM
2010
ACM
199views Data Mining» more  WSDM 2010»
16 years 4 months ago
A Sketch-Based Distance Oracle for Web-Scale Graphs
We study the fundamental problem of computing distances between nodes in large graphs such as the web graph and social networks. Our objective is to be able to answer distance que...
Atish Das Sarma, Sreenivas Gollapudi, Marc Najork,...
HPDC
2008
IEEE
16 years 1 months ago
FaTLease: scalable fault-tolerant lease negotiation with paxos
A lease is a token which grants its owner exclusive access to a resource for a defined span of time. In order to be able to tolerate failures, leases need to be coordinated by di...
Felix Hupfeld, Björn Kolbeck, Jan Stender, Mi...
WDAG
2007
Springer
86views Algorithms» more  WDAG 2007»
16 years 24 days ago
Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks
We consider the problem of minimizing the number of ADMs in optical networks. All previous theoretical studies of this problem dealt with the off-line case, where all the lightpat...
Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks
COMPGEOM
2004
ACM
16 years 4 days ago
An empirical comparison of techniques for updating Delaunay triangulations
The computation of Delaunay triangulations from static point sets has been extensively studied in computational geometry. When the points move with known trajectories, kinetic dat...
Leonidas J. Guibas, Daniel Russel
MM
2004
ACM
248views Multimedia» more  MM 2004»
16 years 4 days ago
Incremental semi-supervised subspace learning for image retrieval
Subspace learning techniques are widespread in pattern recognition research. They include Principal Component Analysis (PCA), Locality Preserving Projection (LPP), etc. These tech...
Xiaofei He