Sciweavers

1760 search results - page 158 / 352
» Connected Set Cover Problem and Its Applications
Sort
View
PODC
2009
ACM
14 years 8 months ago
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
Peer-to-peer systems rely on scalable overlay networks that enable efficient routing between its members. Hypercubic topologies facilitate such operations while each node only nee...
Riko Jacob, Andréa W. Richa, Christian Sche...
PODS
2005
ACM
104views Database» more  PODS 2005»
14 years 8 months ago
Views and queries: determinacy and rewriting
We investigate the question of whether a query can be answered using a set V of views. We first define the problem in information-theoretic terms: we say that V determines if V pr...
Luc Segoufin, Victor Vianu
SIAMDM
2008
79views more  SIAMDM 2008»
13 years 8 months ago
Reconfigurations in Graphs and Grids
Let G be a connected graph, and let V and V two n-element subsets of its vertex set V (G). Imagine that we place a chip at each element of V and we want to move them into the posi...
Gruia Calinescu, Adrian Dumitrescu, János P...
TON
2012
11 years 10 months ago
On New Approaches of Assessing Network Vulnerability: Hardness and Approximation
—Society relies heavily on its networked physical infrastructure and information systems. Accurately assessing the vulnerability of these systems against disruptive events is vit...
Thang N. Dinh, Ying Xuan, My T. Thai, Panos M. Par...
ISPAN
2008
IEEE
14 years 2 months ago
M-Ring: A Distributed, Self-Organized, Load-Balanced Communication Method on Super Peer Network
- Many peer-to-peer file sharing systems have been proposed to take the locality and heterogeneity into account. The two-layered architecture is one of the most widespread systems ...
Tsung-Han Lin, Tsung-Hsuan Ho, Yu-Wei Chan, Yeh-Ch...