Sciweavers

2069 search results - page 381 / 414
» Linear time algorithms for Clobber
Sort
View
ADMA
2006
Springer
110views Data Mining» more  ADMA 2006»
15 years 9 months ago
Learning with Local Drift Detection
Abstract. Most of the work in Machine Learning assume that examples are generated at random according to some stationary probability distribution. In this work we study the problem...
João Gama, Gladys Castillo
CPM
1995
Springer
139views Combinatorics» more  CPM 1995»
15 years 9 months ago
Pattern-Matching for Strings with Short Descriptions
We consider strings which are succinctly described. The description is in terms of straight-line programs in which the constants are symbols and the only operation is the concaten...
Marek Karpinski, Wojciech Rytter, Ayumi Shinohara
BIRTHDAY
2008
Springer
15 years 7 months ago
AND/OR Multi-valued Decision Diagrams for Constraint Networks
The paper is an overview of a recently developed compilation data structure for graphical models, with specific application to constraint networks. The AND/OR Multi-Valued Decision...
Robert Mateescu, Rina Dechter
UAI
2008
15 years 7 months ago
Learning Arithmetic Circuits
Graphical models are usually learned without regard to the cost of doing inference with them. As a result, even if a good model is learned, it may perform poorly at prediction, be...
Daniel Lowd, Pedro Domingos
ALENEX
2009
106views Algorithms» more  ALENEX 2009»
15 years 6 months ago
Drawing Binary Tanglegrams: An Experimental Evaluation
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...
Martin Nöllenburg, Markus Völker, Alexan...