716 search results - page 118 / 144 » Optimizing Sorting with Machine Learning Algorithms |
114
click to vote
ACRI
2004
Springer
15 years 7 months ago
2004
Springer
We have investigated a problem where the goal is to find automatically the best rule for a cell in the cellular automata model. The cells are either of type OBSTACLE, EMPTY or CRE...
109
click to vote
ICML
2008
IEEE
16 years 2 months ago
2008
IEEE
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
128
click to vote
ECML
2007
Springer
15 years 5 months ago
2007
Springer
Mining frequent patterns is a major topic in data mining research, resulting in many seminal papers and algorithms on item set and episode discovery. The combination of these, call...
ML
2007
ACM
15 years 1 months ago
2007
ACM
The problem of disjoint sets, also known as union-find, consists in maintaining a partition of a finite set within a data structure. This structure provides two operations: a fu...
144
click to vote
COLT
2010
Springer
14 years 12 months ago
2010
Springer
We study graph estimation and density estimation in high dimensions, using a family of density estimators based on forest structured undirected graphical models. For density estim...