Sciweavers

208 search results - page 31 / 42
» Improved upper bounds on the crossing number
Sort
View
WAOA
2005
Springer
161views Algorithms» more  WAOA 2005»
14 years 26 days ago
"Almost Stable" Matchings in the Roommates Problem
An instance of the classical Stable Roommates problem (sr) need not admit a stable matching. This motivates the problem of finding a matching that is “as stable as possible”, ...
David J. Abraham, Péter Biró, David ...
MOBICOM
2005
ACM
14 years 29 days ago
Using mobile relays to prolong the lifetime of wireless sensor networks
In this paper we investigate the benefits of a heterogeneous architecture for wireless sensor networks composed of a few resource rich mobile nodes and a large number of simple s...
Wei Wang 0002, Vikram Srinivasan, Kee Chaing Chua
ICIP
2001
IEEE
14 years 9 months ago
Dynamic Active Search for quick object detection with pan-tilt-zoom camera
This paper proposes a search method for detecting known objects quickly in 3D environments with a pan-tilt-zoom camera. In our previous work, we proposed an algorithm named Active...
Takahito Kawanishi, Hiroshi Murase, Shigeru Takagi...
ICDCS
2008
IEEE
14 years 1 months ago
Two-Phased Approximation Algorithms for Minimum CDS in Wireless Ad Hoc Networks
— Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of distributed algorithms for constructing a small CDS in wireless ad hoc ...
Peng-Jun Wan, Lixin Wang, F. Frances Yao
GLVLSI
1996
IEEE
125views VLSI» more  GLVLSI 1996»
13 years 11 months ago
Performance-Driven Interconnect Global Routing
In this paper, we propose a global routing algorithm for multi-layer building-block layouts. The algorithm is based on successive ripup and rerouting while satisfying edge capacit...
Dongsheng Wang, Ernest S. Kuh