4926 search results - page 243 / 986 » Two Graph Algorithms On an Associative Computing Model |
241
Voted
ALGORITHMICA
2011
15 years 1 months ago
2011
Let G = (V, E, w) be a directed graph, where w : V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smalles...
152
click to vote
MST
2007
15 years 5 months ago
2007
Crown structures in a graph are defined and shown to be useful in kernelization algorithms for the classic vertex cover problem. Two vertex cover kernelization methods are discus...
164
click to vote
PRDC
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract—In this paper, we study algebraic aggregate computations in Sensor Networks. The main contribution is the presentation of an early-stopping protocol that computes the av...
149
click to vote
DNA
2006
Springer
15 years 10 months ago
2006
Springer
Content-addressability is a fundamental feature of human memory underlying many associative information retrieval tasks. In contrast to location-based memory devices, content-addre...
156
click to vote
IPPS
2007
IEEE
16 years 21 days ago
2007
IEEE
The design of algorithms that can run unchanged yet efficiently on a variety of machines characterized by different degrees of parallelism and communication capabilities is a hig...