101 search results - page 19 / 21 » Optimal Random Matchings on Trees and Applications |
CVPR
2012
IEEE
11 years 10 months ago
2012
IEEE
A large number of problems in computer vision can be modeled as energy minimization problems in a markov random field (MRF) framework. Many methods have been developed over the y...
HPDC
2007
IEEE
14 years 1 months ago
2007
IEEE
Adapting to the network is the key to achieving high performance for communication-intensive applications, including scientific computing, data intensive computing, and multicast...
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...
IOPADS
1997
13 years 8 months ago
1997
We provide a competitive analysis framework for online prefetching and buffer management algorithms in parallel I/O systems, using a read-once model of block references. This has ...
JNW
2008
13 years 7 months ago
2008
-Recently multicast routing protocols in Mobile Ad-hoc Networks (MANETs) are emerging for wireless group communication. This includes application such as multipoint data disseminat...