4926 search results - page 365 / 986 » Two Graph Algorithms On an Associative Computing Model |
182
click to vote
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
137
click to vote
CCGRID
2001
IEEE
15 years 8 months ago
2001
IEEE
Global Computing achieves high throughput computing by harvesting a very large number of unused computing resources connected to the Internet. This parallel computing model target...
143
Voted
SCALESPACE
1999
Springer
15 years 9 months ago
1999
Springer
The classical morphological segmentation paradigm is based on the watershed transform, constructed by flooding the gradient image seen as a topographic surface. For flooding a to...
133
click to vote
DAC
2006
ACM
16 years 5 months ago
2006
ACM
Simulation and verification using electronic design automation (EDA) tools are key steps in the design process for communication and signal processing systems. The synchronous dat...
140
Voted
INFOCOM
2007
IEEE
15 years 11 months ago
2007
IEEE
— Previous analytical studies [12], [18] of unstructured P2P resilience have assumed exponential user lifetimes and only considered age-independent neighbor replacement. In this ...