598 search results - page 114 / 120 » A random graph model for massive graphs |
STOC
2009
ACM
16 years 9 days ago
2009
ACM
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
123
click to vote
FSTTCS
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
SWAT
2004
Springer
15 years 5 months ago
2004
Springer
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
110
click to vote
CORR
2010
Springer
14 years 11 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...
102
click to vote
PAMI
2010
14 years 10 months ago
2010
—We present a probabilistic method for segmenting instances of a particular object category within an image. Our approach overcomes the deficiencies of previous segmentation tech...