Sciweavers

497 search results - page 40 / 100
» Approximating max-min linear programs with local algorithms
Sort
View
ACMMSP
2004
ACM
101views Hardware» more  ACMMSP 2004»
15 years 3 months ago
Metrics and models for reordering transformations
Irregular applications frequently exhibit poor performance on contemporary computer architectures, in large part because of their inefficient use of the memory hierarchy. Runtime ...
Michelle Mills Strout, Paul D. Hovland
PODS
2002
ACM
138views Database» more  PODS 2002»
15 years 10 months ago
Fast Algorithms For Hierarchical Range Histogram Construction
Data Warehousing and OLAPapplications typically view data as having multiple logical dimensions e.g., product, location with natural hierarchies de ned on each dimension. OLAP que...
Sudipto Guha, Nick Koudas, Divesh Srivastava
ICML
2002
IEEE
15 years 10 months ago
Algorithm-Directed Exploration for Model-Based Reinforcement Learning in Factored MDPs
One of the central challenges in reinforcement learning is to balance the exploration/exploitation tradeoff while scaling up to large problems. Although model-based reinforcement ...
Carlos Guestrin, Relu Patrascu, Dale Schuurmans
ICML
2010
IEEE
14 years 11 months ago
Boosting Classifiers with Tightened L0-Relaxation Penalties
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...
Noam Goldberg, Jonathan Eckstein
HYBRID
2004
Springer
15 years 3 months ago
Inference Methods for Autonomous Stochastic Linear Hybrid Systems
We present a parameter inference algorithm for autonomous stochastic linear hybrid systems, which computes a maximum-likelihood model, given only a set of continuous output data of...
Hamsa Balakrishnan, Inseok Hwang, Jung Soon Jang, ...