814 search results - page 21 / 163 » Optimal pairings |
CVIU
2008
13 years 10 months ago
2008
In this paper we introduce a novel method to address minimization of static and dynamic MRFs. Our approach is based on principles from linear programming and, in particular, on pr...
CORR
2006
Springer
13 years 10 months ago
2006
Springer
n source and destination pairs randomly located in an area want to communicate with each other. Signals transmitted from one user to another at distance r apart are subject to a po...
ICC
2008
IEEE
14 years 4 months ago
2008
IEEE
—For a wireless network with ¢ nodes distributed in an area £ , with ¢ source-destination pairs communicating with each other at some common rate, the hierarchical cooperation...
FOCS
1992
IEEE
14 years 1 months ago
1992
IEEE
We describe dynamic data structures for half-space range reporting and for maintaining the minima of a decomposable function. Using these data structures, we obtain efficient dyna...
ACID
2006
13 years 11 months ago
2006
In a congestion game, several players simultaneously aim at allocating sets of resources, e.g., each player aims at allocating a shortest path between a source/destination pair in ...