Sciweavers

4007 search results - page 743 / 802
» Computation with imprecise probabilities
Sort
View
PVLDB
2010
220views more  PVLDB 2010»
13 years 3 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
TALG
2010
158views more  TALG 2010»
13 years 3 months ago
Clustering for metric and nonmetric distance measures
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
Marcel R. Ackermann, Johannes Blömer, Christi...
ICALP
2011
Springer
13 years 9 days ago
New Algorithms for Learning in Presence of Errors
We give new algorithms for a variety of randomly-generated instances of computational problems using a linearization technique that reduces to solving a system of linear equations...
Sanjeev Arora, Rong Ge
ICDCS
2011
IEEE
12 years 8 months ago
Competitive and Fair Medium Access Despite Reactive Jamming
Abstract—Intentional interference constitutes a major threat for communication networks operating over a shared medium where availability is imperative. Jamming attacks are often...
Andréa W. Richa, Christian Scheideler, Stef...
CORR
2012
Springer
170views Education» more  CORR 2012»
12 years 4 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