4926 search results - page 57 / 986 » Two Graph Algorithms On an Associative Computing Model |
TSD
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. The discovery of words by young infants involves two interrelated processes: (a) the detection of recurrent word-like acoustic patterns in the speech signal, and (b) cros...
ECCV
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We present a detection-based three-level hierarchical association approach to robustly track multiple objects in crowded environments from a single camera. At the low lev...
TAMC
2010
Springer
14 years 23 days ago
2010
Springer
Incrementally k-list coloring a graph means that a graph is given by adding stepwise one vertex after another, and for each intermediate step we ask for a vertex coloring such that...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...
JAR
2000
13 years 7 months ago
2000
The paper compares two popular strategies for solving propositional satis ability, backtracking search and resolution, and analyzes the complexity of a directional resolution algo...