Sciweavers

10054 search results - page 25 / 2011
» On the Complexity of Function Learning
Sort
View
JITECH
2010
116views more  JITECH 2010»
13 years 8 months ago
Design theory for dynamic complexity in information infrastructures: the case of building internet
We propose a design theory that tackles dynamic complexity in the design for Information Infrastructures (IIs) defined as a shared, open, heterogeneous and evolving socio-technica...
Ole Hanseth, Kalle Lyytinen
ICIP
2002
IEEE
14 years 11 months ago
Unsupervised image segmentation via Markov trees and complex wavelets
The goal in image segmentation is to label pixels in an image based on the properties of each pixel and its surrounding region. Recently Content-Based Image Retrieval (CBIR) has e...
Cián W. Shaffrey, Ian Jermyn, Nick G. Kings...
PKDD
2009
Springer
144views Data Mining» more  PKDD 2009»
14 years 4 months ago
Compositional Models for Reinforcement Learning
Abstract. Innovations such as optimistic exploration, function approximation, and hierarchical decomposition have helped scale reinforcement learning to more complex environments, ...
Nicholas K. Jong, Peter Stone
ECML
2003
Springer
14 years 3 months ago
Pairwise Preference Learning and Ranking
We consider supervised learning of a ranking function, which is a mapping from instances to total orders over a set of labels (options). The training information consists of exampl...
Johannes Fürnkranz, Eyke Hüllermeier
FOCS
2010
IEEE
13 years 7 months ago
Learning Convex Concepts from Gaussian Distributions with PCA
We present a new algorithm for learning a convex set in n-dimensional space given labeled examples drawn from any Gaussian distribution. The complexity of the algorithm is bounded ...
Santosh Vempala