613 search results - page 101 / 123 » Time Optimal Self-Stabilizing Spanning Tree Algorithms |
178
click to vote
CP
2009
Springer
16 years 11 days ago
2009
Springer
The most popular architecture for parallel search is work stealing: threads that have run out of work (nodes to be searched) steal from threads that still have work. Work stealing ...
ICPR
2008
IEEE
15 years 6 months ago
2008
IEEE
If there are more clusters than the ideal, each intrinsic cluster will be split into several subsets. Theoretically, this split can be arbitrary and neighboring data points have a ...
ICCV
2009
IEEE
16 years 4 months ago
2009
IEEE
Background subtraction algorithms define the background
as parts of a scene that are at rest. Traditionally,
these algorithms assume a stationary camera, and identify
moving obj...
195
click to vote
ICDE
2003
IEEE
16 years 1 months ago
2003
IEEE
We present a query architecture in which join operators are decomposed into their constituent data structures (State Modules, or SteMs), and dataflow among these SteMs is managed ...
102
click to vote
KDD
2009
ACM
16 years 8 days ago
2009
ACM
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...