Sciweavers

1760 search results - page 152 / 352
» Connected Set Cover Problem and Its Applications
Sort
View
INFOCOM
2003
IEEE
14 years 1 months ago
Integration of 802.11 and Third-Generation Wireless Data Networks
Abstract— The third-generation (3G) wide area wireless networks and 802.11 local area wireless networks possess complementary characteristics. 3G networks promise to offer always...
Milind M. Buddhikot, Girish P. Chandranmenon, Seun...
CVPR
2009
IEEE
1385views Computer Vision» more  CVPR 2009»
15 years 3 months ago
Distributed Multi-Target Tracking In A Self-Configuring Camera Network
This paper deals with the problem of tracking multiple targets in a distributed network of self-configuring pan-tilt-zoom cameras. We focus on applications where events unfold over...
Amit K. Roy Chowdhury, Bi Song, Cristian Soto
ESA
2006
Springer
137views Algorithms» more  ESA 2006»
13 years 12 months ago
Deciding Relaxed Two-Colorability - A Hardness Jump
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...
Robert Berke, Tibor Szabó
ICDCS
2005
IEEE
14 years 1 months ago
The Impossibility of Boosting Distributed Service Resilience
We prove two theorems saying that no distributed system in which processes coordinate using reliable registers and -resilient services can solve the consensus problem in the prese...
Paul C. Attie, Rachid Guerraoui, Petr Kouznetsov, ...
EDBT
2012
ACM
228views Database» more  EDBT 2012»
11 years 10 months ago
Finding maximal k-edge-connected subgraphs from a large graph
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...
Rui Zhou, Chengfei Liu, Jeffrey Xu Yu, Weifa Liang...