Sciweavers

267 search results - page 19 / 54
» Efficient and decentralized computation of approximate globa...
Sort
View
VLSID
2002
IEEE
116views VLSI» more  VLSID 2002»
16 years 4 days ago
Efficient Macromodeling for On-Chip Interconnects
The improved T and improved n models are proposed for onchip interconnect macromodeling. Using global approximations, simple approximation frames are derived and applied to modeli...
Qinwei Xu, Pinaki Mazumder
KDD
2006
ACM
159views Data Mining» more  KDD 2006»
16 years 5 days ago
Global distance-based segmentation of trajectories
This work introduces distance-based criteria for segmentation of object trajectories. Segmentation leads to simplification of the original objects into smaller, less complex primi...
Aris Anagnostopoulos, Michail Vlachos, Marios Hadj...
ECCV
2010
Springer
15 years 4 months ago
Efficient Highly Over-Complete Sparse Coding using a Mixture Model
Sparse coding of sensory data has recently attracted notable attention in research of learning useful features from the unlabeled data. Empirical studies show that mapping the data...
ICML
2006
IEEE
16 years 18 days ago
Fast direct policy evaluation using multiscale analysis of Markov diffusion processes
Policy evaluation is a critical step in the approximate solution of large Markov decision processes (MDPs), typically requiring O(|S|3 ) to directly solve the Bellman system of |S...
Mauro Maggioni, Sridhar Mahadevan
ICML
1999
IEEE
16 years 18 days ago
Least-Squares Temporal Difference Learning
Excerpted from: Boyan, Justin. Learning Evaluation Functions for Global Optimization. Ph.D. thesis, Carnegie Mellon University, August 1998. (Available as Technical Report CMU-CS-...
Justin A. Boyan