2270 search results - page 43 / 454 » On the distribution of eigenvalues of graphs |
CVPR
2010
IEEE
15 years 10 months ago
2010
IEEE
Graph cuts methods are at the core of many state-of-theart algorithms in computer vision due to their efficiency in computing globally optimal solutions. In this paper, we solve t...
128
click to vote
APPROX
2008
Springer
15 years 4 months ago
2008
Springer
In order to perform an average-case analysis for specific input distributions one needs to derive and understand properties of a 'typical' input instance. In the case of...
120
click to vote
SC
2005
ACM
15 years 7 months ago
2005
ACM
Many emerging large-scale data science applications require searching large graphs distributed across multiple memories and processors. This paper presents a distributed breadthï¬...
136
click to vote
ESAS
2006
Springer
15 years 5 months ago
2006
Springer
We derive the optimality results for key pre distribution scheme for distributed sensor networks, and relations between interesting parameters. Namely, given a key-pool of size n ...
111
click to vote
SSS
2010
Springer
15 years 9 days ago
2010
Springer
In this paper we present new distributed protocols to color even rings and general bipartite graphs. Our motivation is to provide algorithmic explanation for human subject experime...