337 search results - page 65 / 68 » Matching Algorithms Are Fast in Sparse Random Graphs |
CORR
2011
Springer
13 years 4 months ago
2011
Springer
Online video chat services such as Chatroulette, Omegle, and vChatter that randomly match pairs of users in video chat sessions are fast becoming very popular, with over a million...
INFOCOM
1998
IEEE
14 years 1 months ago
1998
IEEE
We present the Informed-Source Coding-On-Demand (ISCOD) approach for efficiently supplying non-identical data from a central server to multiple caching clients through a broadcast ...
CVPR
2012
IEEE
11 years 11 months ago
2012
IEEE
We address the problem of weakly supervised semantic segmentation. The training images are labeled only by the classes they contain, not by their location in the image. On test im...
PVM
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Designing and tuning parallel applications with MPI, particularly at large scale, requires understanding the performance implications of different choices of algorithms ...
SIGECOM
2010
ACM
14 years 2 months ago
2010
ACM
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...