3223 search results - page 370 / 645 » The Scaling of Search Cost |
218
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Abstract--Based on the false assumption that multicast incapable (MI) nodes could not be traversed twice on the same wavelength, the light-tree structure was always thought to be o...
179
click to vote
ICASSP
2011
IEEE
14 years 10 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...
213
click to vote
SAC
2011
ACM
14 years 9 months ago
2011
ACM
Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand ...
170
click to vote
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
Localization and mapping in unknown environments becomes more difficult as the complexity of the environment increases. With conventional techniques, the cost of maintaining estim...
326
click to vote
ICDE
2009
IEEE
16 years 8 months ago
2009
IEEE
This demonstration program presents the V*-kNN algorithm, an efficient algorithm to process moving k nearest neighbor queries (MkNN). The V*-kNN algorithm is based on a safe-region...