1614 search results - page 137 / 323 » Breadth-First Heuristic Search |
147
click to vote
TKDE
2008
15 years 4 months ago
2008
Given a user keyword query, current Web search engines return a list of individual Web pages ranked by their "goodness" with respect to the query. Thus, the basic unit fo...
148
click to vote
PPL
2010
14 years 11 months ago
2010
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
118
click to vote
ICIP
1998
IEEE
16 years 6 months ago
1998
IEEE
Motion estimation represents the most computationally intensive task for all efficient motion compensated compression standards. This fact, despite the several eflorts aiming at r...
170
click to vote
CIAC
1994
Springer
15 years 8 months ago
1994
Springer
We consider the problem of maintaining a binary search tree (BST) that minimizes the average access cost needed to satisfy randomly generated requests. We analyze scenarios in whi...
136
click to vote
ICDE
2007
IEEE
15 years 8 months ago
2007
IEEE
The problem of trajectory similarity in moving object databases is a relatively new topic in the spatial and spatiotemporal database literature. Existing work focuses on the spati...