Sciweavers

628 search results - page 24 / 126
» The minimum shift design problem
Sort
View
WINET
2008
86views more  WINET 2008»
13 years 7 months ago
Relay sensor placement in wireless sensor networks
This paper addresses the following relay sensor placement problem: given the set of duty sensors in the plane and the upper bound of the transmission range, compute the minimum nu...
Xiuzhen Cheng, Ding-Zhu Du, Lusheng Wang, Baogang ...
JGAA
2000
179views more  JGAA 2000»
13 years 7 months ago
Approximation Algorithms for Some Graph Partitioning Problems
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...
George He, Jiping Liu, Cheng Zhao
JCO
2007
56views more  JCO 2007»
13 years 7 months ago
An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure
This paper discusses the relation among four problems: graph testing, DNA complex screening, superimposed codes and secure key distribution. We prove a surprising equivalence relat...
H. B. Chen, Ding-Zhu Du, Frank K. Hwang
ECCV
2010
Springer
14 years 22 days ago
3D Point Correspondence by Minimum Description Length in Feature Space
Abstract. Finding point correspondences plays an important role in automatically building statistical shape models from a training set of 3D surfaces. For the point correspondence ...
WIOPT
2006
IEEE
14 years 1 months ago
Combined QoS scheduling and call admission control algorithm in cellular networks
— In this paper, a scheduling problem in wireless networks is considered when there simultaneously exist CBR (constant bit rate) users requiring exact minimum average throughput ...
Hyang-Won Lee, Song Chong