Sciweavers

5169 search results - page 70 / 1034
» Locality approximation using time
Sort
View
NIPS
2000
15 years 3 months ago
APRICODD: Approximate Policy Construction Using Decision Diagrams
We propose a method of approximate dynamic programming for Markov decision processes (MDPs) using algebraic decision diagrams (ADDs). We produce near-optimal value functions and p...
Robert St-Aubin, Jesse Hoey, Craig Boutilier
CPM
2009
Springer
94views Combinatorics» more  CPM 2009»
15 years 9 months ago
Online Approximate Matching with Non-local Distances
Abstract. A black box method was recently given that solves the problem of online approximate matching for a class of problems whose distance functions can be classified as being ...
Raphaël Clifford, Benjamin Sach
MMM
2008
Springer
158views Multimedia» more  MMM 2008»
15 years 8 months ago
Similarity Search in Multimedia Time Series Data Using Amplitude-Level Features
Effective similarity search in multi-media time series such as video or audio sequences is important for content-based multi-media retrieval applications. We propose a framework th...
Johannes Aßfalg, Hans-Peter Kriegel, Peer Kr...
SAC
2006
ACM
15 years 8 months ago
Building the functional performance model of a processor
In this paper, we present an efficient procedure for building a piecewise linear function approximation of the speed function of a processor with hierarchical memory structure. Th...
Alexey L. Lastovetsky, Ravi Reddy, Robert Higgins
GLVLSI
2003
IEEE
219views VLSI» more  GLVLSI 2003»
15 years 7 months ago
Buffer sizing for minimum energy-delay product by using an approximating polynomial
This paper first presents an accurate and efficient method of estimating the short circuit energy dissipation and the output transition time of CMOS buffers. Next the paper descri...
Chang Woo Kang, Soroush Abbaspour, Massoud Pedram