4103 search results - page 244 / 821 » Some results on the Collatz problem |
191
Voted
ICMLA
2008
15 years 8 months ago
2008
In reinforcement learning, it is a common practice to map the state(-action) space to a different one using basis functions. This transformation aims to represent the input data i...
167
click to vote
ICANN
2010
Springer
15 years 7 months ago
2010
Springer
Independent Component Analysis (ICA) is a statistical computation method that transforms a random vector in another one whose components are independent. Because the marginal distr...
154
click to vote
EOR
2010
15 years 6 months ago
2010
Given an undirected graph G = (V, E) with a set V of vertices and a set E of edges, the graph coloring problem consists of partitioning all vertices into k independent sets and th...
166
click to vote
SYNTHESE
2008
15 years 6 months ago
2008
We consider the problems arising from using sequences of experiments to discover the causal structure among a set of variables, none of whom are known ahead of time to be an "...
169
click to vote
ICML
2003
IEEE
16 years 7 months ago
2003
IEEE
Naive Bayes is often used as a baseline in text classification because it is fast and easy to implement. Its severe assumptions make such efficiency possible but also adversely af...