60 search results - page 3 / 12 » On Binary Searching with Nonuniform Costs |
ICASSP
2011
IEEE
12 years 8 months ago
2011
IEEE
In this paper, we extend our previous study on discriminative training using non-uniform criteria for speech recognition. The work will put emphasis on how the acoustic modeling i...
CIAC
1994
Springer
13 years 9 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...
IROS
2006
IEEE
13 years 11 months ago
2006
IEEE
— We present an anytime algorithm for planning paths through high-dimensional, non-uniform cost search spaces. Our approach works by generating a series of Rapidly-exploring Rand...
CORR
2011
Springer
12 years 12 months ago
2011
Springer
At SODA 2009, Demaine et al. presented a novel connection between binary search trees (BSTs) and subsets of points on the plane. This connection was independently discovered by Der...
CAEPIA
2007
Springer
13 years 11 months ago
2007
Springer
We introduce a non-admissible heuristic for planning with action costs, called the set-additive heuristic, that combines the benefits of the additive heuristic used in the HSP pla...