Sciweavers

1532 search results - page 32 / 307
» Connection Relations in Mereotopology
Sort
View
ICDE
2009
IEEE
145views Database» more  ICDE 2009»
15 years 4 months ago
Context-Aware Object Connection Discovery in Large Graphs
— Given a large graph and a set of objects, the task of object connection discovery is to find a subgraph that retains the best connection between the objects. Object connection...
James Cheng, Yiping Ke, Wilfred Ng, Jeffrey Xu Yu
APPROX
2004
Springer
105views Algorithms» more  APPROX 2004»
15 years 3 months ago
Counting Connected Graphs and Hypergraphs via the Probabilistic Method
While it is exponentially unlikely that a sparse random graph or hypergraph is connected, with probability 1 − o(1) such a graph has a “giant component” that, given its numbe...
Amin Coja-Oghlan, Cristopher Moore, Vishal Sanwala...
COLCOM
2009
IEEE
15 years 2 months ago
Square region-based coverage and connectivity probability model in wireless sensor networks
—Sensing coverage and network connectivity are two fundamental issues in wireless sensor networks (WSNs). Due to resource constraints of sensor nodes, it may not be possible, or ...
Xiaofei Xing, Guojun Wang, Jie Wu, Jie Li
ICDE
2007
IEEE
138views Database» more  ICDE 2007»
15 years 11 months ago
ICEDB: Intermittently-Connected Continuous Query Processing
Current distributed database and stream processing systems assume that the network connecting nodes in the data processor is "always on," and that the absence of a netwo...
Yang Zhang, Bret Hull, Hari Balakrishnan, Samuel M...
SECON
2008
IEEE
15 years 4 months ago
Deploying Directional Sensor Networks with Guaranteed Connectivity and Coverage
Abstract—In contrast to existing work on the connected coverage problem in wireless sensor networks which assumes omnidirectional sensors with disk-like sensing range, this paper...
Xiaofeng Han, Xiang Cao, Errol L. Lloyd, Chien-Chu...