Sciweavers

2750 search results - page 118 / 550
» The complexity of learning SUBSEQ(A)
Sort
View
AI
1999
Springer
15 years 6 months ago
Learning by Discovering Concept Hierarchies
We present a new machine learning method that, given a set of training examples, induces a definition of the target concept in terms of a hierarchy of intermediate concepts and th...
Blaz Zupan, Marko Bohanec, Janez Demsar, Ivan Brat...
IVC
2010
128views more  IVC 2010»
15 years 4 months ago
Online kernel density estimation for interactive learning
In this paper we propose a Gaussian-kernel-based online kernel density estimation which can be used for applications of online probability density estimation and online learning. ...
Matej Kristan, Danijel Skocaj, Ales Leonardis
WEBI
2010
Springer
15 years 4 months ago
Learning Task Specific Web Services Compositions with Loops and Conditional Branches from Example Executions
Majority of the existing approaches to service composition, including the widely popular planning based techniques, are not able to automatically compose practical workflows that ...
Harini Veeraraghavan, Roman Vaculín, Manuel...
ICMCS
2009
IEEE
130views Multimedia» more  ICMCS 2009»
15 years 4 months ago
Fast multi-reference motion estimation via statistical learning for H.264/AVC
In the H.264/AVC coding standard, motion estimation (ME) is allowed to use multiple reference frames to make full use of reducing temporal redundancy in a video sequence. Although...
Chen-Kuo Chiang, Shang-Hong Lai
INFOCOM
2012
IEEE
13 years 8 months ago
Approximately optimal adaptive learning in opportunistic spectrum access
—In this paper we develop an adaptive learning algorithm which is approximately optimal for an opportunistic spectrum access (OSA) problem with polynomial complexity. In this OSA...
Cem Tekin, Mingyan Liu