Sciweavers

1021 search results - page 53 / 205
» Fast Approximate PCPs
Sort
View
138
Voted
SSDBM
1999
IEEE
124views Database» more  SSDBM 1999»
15 years 6 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
15 years 3 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
15 years 3 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
EUROGRAPHICS
2010
Eurographics
15 years 3 months ago
Fast and Efficient Skinning of Animated Meshes
Skinning is a simple yet popular deformation technique combining compact storage with efficient hardware accelerated rendering. While skinned meshes (such as virtual characters) a...
Ladislav Kavan, Peter-Pike Sloan, Carol O'Sullivan
JSCIC
2006
98views more  JSCIC 2006»
15 years 1 months ago
Optimal Strong-Stability-Preserving Time-Stepping Schemes with Fast Downwind Spatial Discretizations
In the field of strong-stability-preserving time discretizations, a number of researchers have considered using both upwind and downwind approximations for the same derivative, in...
Sigal Gottlieb, Steven J. Ruuth