1538 search results - page 198 / 308 » Spectral Techniques in Graph Algorithms |
100
click to vote
ICCSA
2004
Springer
15 years 7 months ago
2004
Springer
The algorithmic techniques which allow high efficiency in the precise calculation of the reliability of an undirected graph with absolutely reliable nodes and unreliable edges are ...
109
click to vote
IPPS
1998
IEEE
15 years 5 months ago
1998
IEEE
This paper shows the power of randomization in designing e cient parallel algorithms for the problems of routing and PRAM emulation. We show that with randomization techniques opti...
106
click to vote
ICIP
2001
IEEE
16 years 3 months ago
2001
IEEE
The proliferation of video content on the web makes similarity detection an indispensable tool in web data management, searching, and navigation. We have previously proposed a com...
110
click to vote
PODC
2005
ACM
15 years 7 months ago
2005
ACM
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...
117
click to vote
NIPS
2001
15 years 2 months ago
2001
This paper presents an unsupervised learning algorithm that can derive the probabilistic dependence structure of parts of an object (a moving human body in our examples) automatic...