Sciweavers

1511 search results - page 33 / 303
» Randomness, lowness and degrees
Sort
View
MOBIHOC
2002
ACM
16 years 5 months ago
On the minimum node degree and connectivity of a wireless multihop network
This paper investigates two fundamental characteristics of a wireless multihop network: its minimum node degree and its k?connectivity. Both topology attributes depend on the spat...
Christian Bettstetter
SIGCOMM
2006
ACM
16 years 22 hour ago
Systematic topology analysis and generation using degree correlations
Researchers have proposed a variety of metrics to measure important graph properties, for instance, in social, biological, and computer networks. Values for a particular graph met...
Priya Mahadevan, Dmitri V. Krioukov, Kevin R. Fall...
164
Voted
IPTPS
2005
Springer
15 years 11 months ago
A Self-repairing Peer-to-Peer System Resilient to Dynamic Adversarial Churn
We present a dynamic distributed hash table where peers may join and leave at any time. Our system tolerates a powerful adversary which has complete visibility of the entire state ...
Fabian Kuhn, Stefan Schmid, Roger Wattenhofer
STOC
2001
ACM
138views Algorithms» more  STOC 2001»
16 years 6 months ago
Fast computation of low rank matrix
Given a matrix A, it is often desirable to find a good approximation to A that has low rank. We introduce a simple technique for accelerating the computation of such approximation...
Dimitris Achlioptas, Frank McSherry
ICIP
2008
IEEE
16 years 7 months ago
Salient point characterization for low resolution meshes
This paper deals with edge detection and vertex characterization of 3D meshes. First, a new measure is introduced, the saliency degree, which provide directly the shape informatio...
Nicolas Walter, Olivier Aubreton, Olivier Laligant