2194 search results - page 39 / 439 » Improving HLRTA*( k ) |
IJCV
1998
13 years 10 months ago
1998
There are many computational vision techniques that fundamentally rely upon assumptions about the nature of diffuse reflection from object surfaces consisting of commonly occurrin...
ICALP
2011
Springer
13 years 2 months ago
2011
Springer
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...
COCO
1990
Springer
14 years 3 months ago
1990
Springer
We show that if the Boolean hierarchy collapses to level k, then the polynomial hierarchy collapses to BH3(k), where BH3(k) is the kth level of the Boolean hierarchy over P 2 . Th...
ESA
2008
Springer
14 years 22 days ago
2008
Springer
The edge asymmetry of a directed, edge-weighted graph is defined as the maximum ratio of the weight of antiparallel edges in the graph, and can be used as a measure of the heterog...
FAW
2009
Springer
14 years 5 months ago
2009
Springer