1263 search results - page 121 / 253 » A* with Bounded Costs |
191
click to vote
IAT
2009
IEEE
16 years 1 months ago
2009
IEEE
In building practical sensor networks, it is often beneficial to use only a subset of sensors to take measurements because of computational, communication, and power limitations....
155
click to vote
ICIP
2007
IEEE
16 years 20 days ago
2007
IEEE
Block based motion compensation techniques make frequent use of Early Termination Algorithms (ETA) to reduce the computational cost of block matching process. ETAs have been well ...
173
click to vote
SWAT
2004
Springer
15 years 11 months ago
2004
Springer
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
146
click to vote
ENTCS
2002
15 years 6 months ago
2002
Splay trees, a form of self-adjusting binary tree, were introduced by Sleator and Tarjan in the early 1980s. Their main use is to store ordered lists. The idea is to keep the tree...
173
click to vote
FLAIRS
2009
15 years 4 months ago
2009
While team action recognition has a relatively extended literature, less attention has been given to the detailed realtime analysis of the internal structure of the team actions. ...