Sciweavers

312 search results - page 50 / 63
» Iterative compression and exact algorithms
Sort
View
JAIR
2006
160views more  JAIR 2006»
13 years 9 months ago
Anytime Point-Based Approximations for Large POMDPs
The Partially Observable Markov Decision Process has long been recognized as a rich framework for real-world planning and control problems, especially in robotics. However exact s...
Joelle Pineau, Geoffrey J. Gordon, Sebastian Thrun
SIGMETRICS
2008
ACM
181views Hardware» more  SIGMETRICS 2008»
13 years 9 months ago
Counter braids: a novel counter architecture for per-flow measurement
Fine-grained network measurement requires routers and switches to update large arrays of counters at very high link speed (e.g. 40 Gbps). A naive algorithm needs an infeasible amo...
Yi Lu, Andrea Montanari, Balaji Prabhakar, Sarang ...
KDD
2010
ACM
199views Data Mining» more  KDD 2010»
14 years 1 months ago
Online discovery and maintenance of time series motifs
The detection of repeated subsequences, time series motifs, is a problem which has been shown to have great utility for several higher-level data mining algorithms, including clas...
Abdullah Mueen, Eamonn J. Keogh
CGF
2008
150views more  CGF 2008»
13 years 10 months ago
Compact, Fast and Robust Grids for Ray Tracing
The focus of research in acceleration structures for ray tracing recently shifted from render time to time to image, the sum of build time and render time, and also the memory foo...
Ares Lagae, Philip Dutré
TACAS
2005
Springer
108views Algorithms» more  TACAS 2005»
14 years 3 months ago
On Some Transformation Invariants Under Retiming and Resynthesis
Transformations using retiming and resynthesis operations are the most important and practical (if not the only) techniques used in optimizing synchronous hardware systems. Althoug...
Jie-Hong Roland Jiang