75 search results - page 14 / 15 » Randomly Coloring Constant Degree Graphs |
158
click to vote
KDD
2012
ACM
13 years 5 months ago
2012
ACM
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...
130
click to vote
SPAA
2003
ACM
15 years 8 months ago
2003
ACM
We propose a new approach for constructing P2P networks based on a dynamic decomposition of a continuous space into cells corresponding to servers. We demonstrate the power of thi...
133
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
In this paper, we study the average case complexity of the Unique Games problem. We propose a natural semi-random model, in which a unique game instance is generated in several st...
116
Voted
ESA
2005
Springer
15 years 8 months ago
2005
Springer
Sensor nodes are very weak computers that get distributed at random on a surface. Once deployed, they must wake up and form a radio network. Sensor network bootstrapping research t...
129
click to vote
STOC
2005
ACM
16 years 3 months ago
2005
ACM
We present new explicit constructions of deterministic randomness extractors, dispersers and related objects. We say that a distribution X on binary strings of length n is a -sour...