Sciweavers

240 search results - page 16 / 48
» Using Distance Estimates in Heuristic Search
Sort
View
ICDE
2009
IEEE
219views Database» more  ICDE 2009»
14 years 10 months ago
Distance Oracles for Spatial Networks
The popularity of location-based services and the need to do real-time processing on them has led to an interest in performing queries on transportation networks, such as finding s...
Jagan Sankaranarayanan, Hanan Samet
ICASSP
2010
IEEE
13 years 3 months ago
Search error risk minimization in Viterbi beam search for speech recognition
This paper proposes a method to optimize Viterbi beam search based on search error risk minimization in large vocabulary continuous speech recognition (LVCSR). Most speech recogni...
Takaaki Hori, Shinji Watanabe, Atsushi Nakamura
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
11 years 11 months ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu
PROCEDIA
2011
12 years 11 months ago
Exact Closest String as a Constraint Satisfaction Problem
We report the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration of symbol occurrenc...
Tom Kelsey, Lars Kotthoff
INTERSPEECH
2010
13 years 3 months ago
Improvements of search error risk minimization in viterbi beam search for speech recognition
This paper describes improvements in a search error risk minimization approach to fast beam search for speech recognition. In our previous work, we proposed this approach to reduc...
Takaaki Hori, Shinji Watanabe, Atsushi Nakamura