4926 search results - page 141 / 986 » Two Graph Algorithms On an Associative Computing Model |
141
click to vote
PERCOM
2006
ACM
16 years 6 months ago
2006
ACM
A recent flooding algorithm [1] guaranteed correctness for networks with dynamic edges and fixed nodes. The algorithm provided a partial answer to the highly dynamic network (HDN)...
152
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
We describe an algorithm for clustering using a similarity graph. The algorithm (a) runs in O(n log3 n + m log n) time on graphs with n vertices and m edges, and (b) with high pro...
194
click to vote
CCCG
2007
15 years 7 months ago
2007
We consider the problem of two-dimensional outputsensitive convex hull in the cache-oblivious model. That is, we are interested in minimizing the number of cache faults caused whe...
185
click to vote
WEA
2009
Springer
15 years 11 months ago
2009
Springer
Flash memory-based solid-state disks are fast becoming the dominant form of end-user storage devices, partly even replacing the traditional hard-disks. Existing two-level memory hi...
205
click to vote
IJCV
2008
15 years 6 months ago
2008
This paper describes two algorithms for the real-time segmentation of foreground from background layers in stereo video sequences. Automatic separation of layers from colour/contr...