1641 search results - page 56 / 329 » Termination Analysis with Algorithmic Learning |
144
click to vote
ICML
2009
IEEE
16 years 4 months ago
2009
IEEE
Training principles for unsupervised learning are often derived from motivations that appear to be independent of supervised learning. In this paper we present a simple unificatio...
152
Voted
COLT
2006
Springer
15 years 7 months ago
2006
Springer
We describe a novel framework for the design and analysis of online learning algorithms based on the notion of duality in constrained optimization. We cast a sub-family of universa...
139
click to vote
ICMLA
2008
15 years 5 months ago
2008
We revisit 26 meta-features typically used in the context of meta-learning for model selection. Using visual analysis and computational complexity considerations, we find 4 meta-f...
153
Voted
ICPADS
2007
IEEE
15 years 9 months ago
2007
IEEE
Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum weight subtree spanning a given subset of (terminal) nodes...
93
Voted
GPCE
2007
Springer
15 years 7 months ago
2007
Springer
This paper introduces new parsing and context-aware scanning algorithms in which the scanner uses contextual information to disambiguate lexical syntax. The parser uses a slightly...