Sciweavers

2924 search results - page 576 / 585
» Lower Bounds in Distributed Computing
Sort
View
PVLDB
2010
220views more  PVLDB 2010»
13 years 2 months ago
Fast Incremental and Personalized PageRank
In this paper, we analyze the efficiency of Monte Carlo methods for incremental computation of PageRank, personalized PageRank, and similar random walk based methods (with focus o...
Bahman Bahmani, Abdur Chowdhury, Ashish Goel
PR
2011
12 years 10 months ago
A novel multi-view learning developed from single-view patterns
The existing Multi-View Learning (MVL) learns how to process patterns with multiple information sources. In generalization this MVL is proven to have a significant advantage over...
Zhe Wang, Songcan Chen, Daqi Gao
SMA
2009
ACM
132views Solid Modeling» more  SMA 2009»
14 years 2 months ago
Robust Voronoi-based curvature and feature estimation
Many algorithms for shape analysis and shape processing rely on accurate estimates of differential information such as normals and curvature. In most settings, however, care must...
Quentin Mérigot, Maks Ovsjanikov, Leonidas ...
CORR
2012
Springer
170views Education» more  CORR 2012»
12 years 3 months ago
What Cannot be Learned with Bethe Approximations
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
Uri Heinemann, Amir Globerson
GI
2004
Springer
14 years 1 months ago
An Architecture Concept for Mobile P2P File Sharing Services
Abstract: File-sharing in mobile networks has differing demands to a P2P architecture. Resource access and mediation techniques must follow constraints given in 2.5G/3G networks. E...
Frank-Uwe Andersen, Hermann de Meer, Ivan Dedinski...