2270 search results - page 308 / 454 » On the distribution of eigenvalues of graphs |
166
click to vote
STOC
2005
ACM
16 years 6 months ago
2005
ACM
The Write-All problem for an asynchronous shared-memory system has the objective for the processes to update the contents of a set of shared registers, while minimizing the mber o...
172
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
165
click to vote
SIGCOMM
2009
ACM
16 years 27 days ago
2009
ACM
The analysis of social and technological networks has attracted a lot of attention as social networking applications and mobile sensing devices have given us a wealth of real data...
163
click to vote
COLT
2007
Springer
16 years 17 days ago
2007
Springer
We present a new class of problems, called resource-bounded information gathering for correlation clustering. Our goal is to perform correlation clustering under circumstances in w...
175
click to vote
SCALESPACE
2005
Springer
15 years 12 months ago
2005
Springer
In previous work, singular points (or top points) in the scale space representation of generic images have proven valuable for image matching. In this paper, we propose a construct...