Sciweavers

3678 search results - page 359 / 736
» On the Stable Paths Problem
Sort
View
IPCO
2010
231views Optimization» more  IPCO 2010»
15 years 8 months ago
Branched Polyhedral Systems
We introduce the framework of polyhedral branching systems that can be used in order to construct extended formulations for polyhedra by combining extended formulations for other p...
Volker Kaibel, Andreas Loos
FTNET
2007
107views more  FTNET 2007»
15 years 6 months ago
Network Optimization and Control
We study how protocol design for various functionalities within a communication network architecture can be viewed as a distributed resource allocation problem. This involves unde...
Srinivas Shakkottai, R. Srikant
PAMI
2006
156views more  PAMI 2006»
15 years 6 months ago
Robust Point Matching for Nonrigid Shapes by Preserving Local Neighborhood Structures
In previous work on point matching, a set of points is often treated as an instance of a joint distribution to exploit global relationships in the point set. For nonrigid shapes, h...
Yefeng Zheng, David S. Doermann
TCSV
2008
202views more  TCSV 2008»
15 years 6 months ago
Probabilistic Object Tracking With Dynamic Attributed Relational Feature Graph
Object tracking is one of the fundamental problems in computer vision and has received considerable attention in the past two decades. The success of a tracking algorithm relies on...
Feng Tang, Hai Tao
TWC
2008
112views more  TWC 2008»
15 years 6 months ago
Design and Analysis of Cross-Layer Tree Algorithms for Wireless Random Access
In this paper, we develop a random access scheme which combines the widely used binary exponential backoff (BEB) algorithm with a cross-layer tree algorithm (TA) that relies on suc...
Xin Wang, Yingqun Yu, Georgios B. Giannakis