Sciweavers

454 search results - page 79 / 91
» On improving approximate solutions by evolutionary algorithm...
Sort
View
JMLR
2008
209views more  JMLR 2008»
14 years 11 months ago
Bayesian Inference and Optimal Design for the Sparse Linear Model
The linear model with sparsity-favouring prior on the coefficients has important applications in many different domains. In machine learning, most methods to date search for maxim...
Matthias W. Seeger
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
15 years 4 months ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...
ECML
2006
Springer
15 years 3 months ago
Prioritizing Point-Based POMDP Solvers
Recent scaling up of POMDP solvers towards realistic applications is largely due to point-based methods such as PBVI, Perseus, and HSVI, which quickly converge to an approximate so...
Guy Shani, Ronen I. Brafman, Solomon Eyal Shimony
IJRR
2010
162views more  IJRR 2010»
14 years 10 months ago
Planning under Uncertainty for Robotic Tasks with Mixed Observability
Partially observable Markov decision processes (POMDPs) provide a principled, general framework for robot motion planning in uncertain and dynamic environments. They have been app...
Sylvie C. W. Ong, Shao Wei Png, David Hsu, Wee Sun...
KDD
2006
ACM
107views Data Mining» more  KDD 2006»
16 years 3 days ago
Out-of-core frequent pattern mining on a commodity PC
In this work we focus on the problem of frequent itemset mining on large, out-of-core data sets. After presenting a characterization of existing out-of-core frequent itemset minin...
Gregory Buehrer, Srinivasan Parthasarathy, Amol Gh...