172 search results - page 34 / 35 » The Complexity of Unions of Disjoint Sets |
EDCC
2010
Springer
13 years 10 months ago
2010
Springer
Distributed Hash Tables (DHTs) and Random Peer Sampling (RPS) provide important and complementary services in the area of P2P overlay networks. DHTs achieve efficient lookup whil...
SODA
1992
ACM
13 years 7 months ago
1992
ACM
Given a family of disjoint polygons P1, P2, : : :, Pk in the plane, and an integer parameter m, it is NP-complete to decide if the Pi's can be pairwise separated by a polygon...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. We present the discrete beeping communication model, which assumes nodes have minimal knowledge about their environment and severely limited communication capabilities. S...
TMI
2008
13 years 5 months ago
2008
Abstract-- The projection data measured in computed tomography (CT) and, consequently, the slices reconstructed from these data are noisy. We present a new wavelet based structurep...
IPSN
2011
Springer
12 years 9 months ago
2011
Springer
In a sensor network there are many paths between a source and a destination. An efficient method to explore and navigate in the ‘path space’ can help many important routing p...