Sciweavers

4865 search results - page 544 / 973
» The Complexity of Graph Connectivity
Sort
View
CN
2004
114views more  CN 2004»
15 years 7 months ago
Representing the Internet as a succinct forest
Effective placement of resources used to support distributed services in the Internet depends on an accurate representation of Internet topology and routing. Representations of au...
Jim Gast, Paul Barford
COMBINATORICS
1998
89views more  COMBINATORICS 1998»
15 years 6 months ago
Venn Diagrams with Few Vertices
An n-Venn diagram is a collection of n finitely-intersecting simple closed curves in the plane, such that each of the 2n sets X1 ∩X2 ∩· · ·∩Xn, where each Xi is the open...
Bette Bultena, Frank Ruskey
CORR
2010
Springer
107views Education» more  CORR 2010»
15 years 5 months ago
Distributed Detection over Time Varying Networks: Large Deviations Analysis
—We apply large deviations theory to study asymptotic performance of running consensus distributed detection in sensor networks. Running consensus is a stochastic approximation t...
Dragana Bajovic, Dusan Jakovetic, João Xavi...
TMC
2010
104views more  TMC 2010»
15 years 5 months ago
On Nodal Encounter Patterns in Wireless LAN Traces
—In this paper we analyze multiple wireless LAN (WLAN) traces from university and corporate campuses. In particular, we consider an important event between mobile nodes in wirele...
Wei-jen Hsu, Ahmed Helmy
CORR
2010
Springer
114views Education» more  CORR 2010»
15 years 5 months ago
Efficiently Discovering Hammock Paths from Induced Similarity Networks
ty networks are important abstractions in many information management applications such as recommender systems, corpora analysis, and medical informatics. For instance, in a recom...
M. Shahriar Hossain, Michael Narayan, Naren Ramakr...