4926 search results - page 485 / 986 » Two Graph Algorithms On an Associative Computing Model |
147
click to vote
FLAIRS
2008
15 years 6 months ago
2008
Solving relaxed problems is a commonly used technique in heuristic search to derive heuristic estimates. In heuristic planning, this is usually done by expanding a planning (reach...
121
Voted
DLT
2006
15 years 5 months ago
2006
We investigate the following lower bound methods for regular languages: The fooling set technique, the extended fooling set technique, and the biclique edge cover technique. It is ...
136
Voted
COMBINATORICA
2007
15 years 3 months ago
2007
The standard Erd˝os-Renyi model of random graphs begins with n isolated vertices, and at each round a random edge is added. Parametrizing n 2 rounds as one time unit, a phase tra...
119
Voted
MFCS
2007
Springer
15 years 10 months ago
2007
Springer
Consider a rooted directed acyclic graph G = (V, E) with root r, representing a collection V of web pages connected via a set E of hyperlinks. Each node v is associated with the pr...
124
Voted
ICPR
2006
IEEE
16 years 4 months ago
2006
IEEE
This article describes a multiple feature data fusion applied to an auxiliary particle filter for markerless tracking of 3D two-arm gestures by using a single camera mounted on a ...