Sciweavers

1054 search results - page 54 / 211
» Fast Approximated SIFT
Sort
View
ACL
1996
14 years 11 months ago
Fast Parsing Using Pruning and Grammar Specialization
We show how a general grammar may be automatically adapted for fast parsing of utterances from a specific domain by means of constituent pruning and grammar specialization based o...
Manny Rayner, David M. Carter
CSDA
2010
119views more  CSDA 2010»
14 years 10 months ago
Fast robust estimation of prediction error based on resampling
Robust estimators of the prediction error of a linear model are proposed. The estimators are based on the resampling techniques cross-validation and bootstrap. The robustness of t...
Jafar A. Khan, Stefan Van Aelst, Ruben H. Zamar
SSDBM
1999
IEEE
124views Database» more  SSDBM 1999»
15 years 2 months ago
An Indexing Scheme for Fast Similarity Search in Large Time Series Databases
We address the problem of similarity search in large time series databases. We introduce a novel indexing algorithm that allows faster retrieval. The index is formed by creating b...
Eamonn J. Keogh, Michael J. Pazzani
ATAL
2008
Springer
14 years 11 months ago
The permutable POMDP: fast solutions to POMDPs for preference elicitation
The ability for an agent to reason under uncertainty is crucial for many planning applications, since an agent rarely has access to complete, error-free information about its envi...
Finale Doshi, Nicholas Roy
IJCAI
2007
14 years 11 months ago
A Fast Analytical Algorithm for Solving Markov Decision Processes with Real-Valued Resources
Agents often have to construct plans that obey deadlines or, more generally, resource limits for real-valued resources whose consumption can only be characterized by probability d...
Janusz Marecki, Sven Koenig, Milind Tambe