Sciweavers

17760 search results - page 62 / 3552
» A Generalization of the Massey-Ding Algorithm
Sort
View
BMCBI
2007
105views more  BMCBI 2007»
15 years 1 months ago
Finding regulatory elements and regulatory motifs: a general probabilistic framework
Over the last two decades a large number of algorithms has been developed for regulatory motif finding. Here we show how many of these algorithms, especially those that model bind...
Erik van Nimwegen
ATAL
2009
Springer
15 years 8 months ago
Generalized model learning for reinforcement learning in factored domains
Improving the sample efficiency of reinforcement learning algorithms to scale up to larger and more realistic domains is a current research challenge in machine learning. Model-ba...
Todd Hester, Peter Stone
ICDE
2006
IEEE
97views Database» more  ICDE 2006»
15 years 7 months ago
Measuring Generality of Documents
Most traditional Information Retrieval (IR) systems, including web search engines, operationalize “relevant” as the word frequency in a document of a set of keywords. Because ...
Hyun Woong Shin, Eduard H. Hovy, Dennis McLeod, La...
JMLR
2010
148views more  JMLR 2010»
14 years 8 months ago
A Generalized Path Integral Control Approach to Reinforcement Learning
With the goal to generate more scalable algorithms with higher efficiency and fewer open parameters, reinforcement learning (RL) has recently moved towards combining classical tec...
Evangelos Theodorou, Jonas Buchli, Stefan Schaal
ICML
2006
IEEE
16 years 2 months ago
Generalized spectral bounds for sparse LDA
We present a discrete spectral framework for the sparse or cardinality-constrained solution of a generalized Rayleigh quotient. This NPhard combinatorial optimization problem is c...
Baback Moghaddam, Yair Weiss, Shai Avidan