2796 search results - page 302 / 560 » The coolest path problem |
169
click to vote
MVA
2002
15 years 6 months ago
2002
Stereo is a useful technique for obtaining depth information from images. However, it is required that the baseline length between two cameras should be large to increase depth pr...
177
click to vote
TCAD
2002
15 years 6 months ago
2002
Many tasks in CAD, such as equivalence checking, property checking, logic synthesis, and false paths analysis require efficient Boolean reasoning for problems derived from circuits...
167
click to vote
PVLDB
2010
15 years 5 months ago
2010
In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional ...
188
click to vote
GD
2006
Springer
15 years 10 months ago
2006
Springer
st-orientations (st-numberings) or bipolar orientations of undirected graphs are central to many graph algorithms and applications. Several algorithms have been proposed in the pas...
191
Voted
DEBU
2010
15 years 6 months ago
2010
The popularity of location-based services and the need to perform real-time processing on them has led to an interest in queries on road networks, such as finding shortest paths a...