Sciweavers

598 search results - page 75 / 120
» A random graph model for massive graphs
Sort
View
CORR
2011
Springer
205views Education» more  CORR 2011»
14 years 3 months ago
Algorithms for Implicit Hitting Set Problems
A hitting set for a collection of sets is a set that has a nonempty intersection with each set in the collection; the hitting set problem is to find a hitting set of minimum card...
Karthekeyan Chandrasekaran, Richard Karp, Erick Mo...
PE
2008
Springer
108views Optimization» more  PE 2008»
14 years 11 months ago
Rate-optimal schemes for Peer-to-Peer live streaming
In this paper we consider the problem of sending data in real time from information sources to sets of receivers, using peer-to-peer communications. We consider several models of ...
Laurent Massoulié, Andrew Twigg
ECCV
2008
Springer
16 years 1 months ago
Efficiently Learning Random Fields for Stereo Vision with Sparse Message Passing
As richer models for stereo vision are constructed, there is a growing interest in learning model parameters. To estimate parameters in Markov Random Field (MRF) based stereo formu...
Jerod J. Weinman, Lam Tran, Christopher J. Pal
DKE
2007
130views more  DKE 2007»
14 years 12 months ago
Enabling access-privacy for random walk based data analysis applications
Random walk graph and Markov chain based models are used heavily in many data and system analysis domains, including web, bioinformatics, and queuing. These models enable the desc...
Ping Lin, K. Selçuk Candan
VALUETOOLS
2006
ACM
149views Hardware» more  VALUETOOLS 2006»
15 years 5 months ago
Tail asymptotics for discrete event systems
In the context of communication networks, the framework of stochastic event graphs allows a modeling of control mechanisms induced by the communication protocol and an analysis of ...
Marc Lelarge