Sciweavers

1641 search results - page 162 / 329
» Termination Analysis with Algorithmic Learning
Sort
View
99
Voted
COR
2008
122views more  COR 2008»
15 years 22 days ago
First steps to the runtime complexity analysis of ant colony optimization
: The paper presents results on the runtime complexity of two ant colony optimization (ACO) algorithms: Ant System, the oldest ACO variant, and GBAS, the first ACO variant for whic...
Walter J. Gutjahr
110
Voted
ALT
2007
Springer
15 years 6 months ago
On Universal Transfer Learning
In transfer learning the aim is to solve new learning tasks using fewer examples by using information gained from solving related tasks. Existing transfer learning methods have be...
M. M. Hassan Mahmud
93
Voted
ICML
2010
IEEE
15 years 1 months ago
On Sparse Nonparametric Conditional Covariance Selection
We develop a penalized kernel smoothing method for the problem of selecting nonzero elements of the conditional precision matrix, known as conditional covariance selection. This p...
Mladen Kolar, Ankur P. Parikh, Eric P. Xing
110
Voted
CVPR
2008
IEEE
16 years 2 months ago
Unsupervised learning of probabilistic object models (POMs) for object classification, segmentation and recognition
We present a new unsupervised method to learn unified probabilistic object models (POMs) which can be applied to classification, segmentation, and recognition. We formulate this a...
Yuanhao Chen, Long Zhu, Alan L. Yuille, HongJiang ...
STOC
2005
ACM
129views Algorithms» more  STOC 2005»
16 years 28 days ago
Learning with attribute costs
We study an extension of the "standard" learning models to settings where observing the value of an attribute has an associated cost (which might be different for differ...
Haim Kaplan, Eyal Kushilevitz, Yishay Mansour