Sciweavers

2446 search results - page 260 / 490
» Choiceless Polynomial Time
Sort
View
GLVLSI
2009
IEEE
131views VLSI» more  GLVLSI 2009»
14 years 2 months ago
Octilinear redistributive routing in bump arrays
This paper proposes a scheme for automatic re-distribution layer (RDL) routing, which is used in chip-package connections. Traditional RDL routing designs are mostly performed man...
Renshen Wang, Chung-Kuan Cheng
ICC
2009
IEEE
190views Communications» more  ICC 2009»
14 years 2 months ago
Decomposition for Low-Complexity Near-Optimal Routing in Multi-Hop Wireless Networks
Abstract—Network flow models serve as a popular mathematical framework for the analysis and optimization of Multi-hop Wireless Networks. They also serve to provide the understan...
Vinay Kolar, Nael B. Abu-Ghazaleh, Petri Mäh&...
INFOCOM
2009
IEEE
14 years 2 months ago
Greedy Routing with Bounded Stretch
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...
Roland Flury, Sriram V. Pemmaraju, Roger Wattenhof...
INFOCOM
2009
IEEE
14 years 2 months ago
Minimum Maximum Degree Publish-Subscribe Overlay Network Design
—Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For sca...
Melih Onus, Andréa W. Richa
ACCV
2009
Springer
14 years 2 months ago
A Dynamic Programming Approach to Maximizing Tracks for Structure from Motion
We present a novel algorithm for improving the accuracy of structure from motion on video sequences. Its goal is to efficiently recover scene structure and camera pose by using dyn...
Jonathan Mooser, Suya You, Ulrich Neumann, Raphael...