Sciweavers

1760 search results - page 195 / 352
» Connected Set Cover Problem and Its Applications
Sort
View
CORR
2011
Springer
268views Education» more  CORR 2011»
12 years 11 months ago
Approximation Algorithms for Submodular Multiway Partition
Abstract— We study algorithms for the SUBMODULAR MULTIWAY PARTITION problem (SUB-MP). An instance of SUB-MP consists of a finite ground set V , a subset S = {s1, s2, . . . , sk}...
Chandra Chekuri, Alina Ene
ICDCS
2010
IEEE
13 years 10 months ago
Distributed Coverage in Wireless Ad Hoc and Sensor Networks by Topological Graph Approaches
Abstract—Coverage problem is a fundamental issue in wireless ad hoc and sensor networks. Previous techniques for coverage scheduling often require accurate location information o...
Dezun Dong, Yunhao Liu, Kebin Liu, Xiangke Liao
ECCV
2006
Springer
13 years 10 months ago
Robust Face Alignment Based on Hierarchical Classifier Network
Abstract. Robust face alignment is crucial for many face processing applications. As face detection only gives a rough estimation of face region, one important problem is how to al...
Li Zhang, Haizhou Ai, Shihong Lao
CSCW
2012
ACM
12 years 3 months ago
DiscoTech: a plug-in toolkit to improve handling of disconnection and reconnection in real-time groupware
Disconnection and reconnection are common problems for users of synchronous groupware, but these problems are not easy for developers to handle because of the wide range of scenar...
Banani Roy, T. C. Nicholas Graham, Carl Gutwin
CORR
2010
Springer
119views Education» more  CORR 2010»
13 years 8 months ago
Graph-Constrained Group Testing
Non-adaptive group testing involves grouping arbitrary subsets of n items into different pools. Each pool is then tested and defective items are identified. A fundamental question...
Mahdi Cheraghchi, Amin Karbasi, Soheil Mohajer, Ve...