Sciweavers

1389 search results - page 143 / 278
» Lightweight dependent classes
Sort
View
137
Voted
NIPS
1994
15 years 3 months ago
On-line Learning of Dichotomies
The performance of on-line algorithms for learning dichotomies is studied. In on-line learning, the number of examples P is equivalent to the learning time, since each example is ...
N. Barkai, H. Sebastian Seung, Haim Sompolinsky
UAI
1996
15 years 3 months ago
Critical Remarks on Single Link Search in Learning Belief Networks
In learning belief networks, the single link lookahead search is widely adopted to reduce the search space. We show that there exists a class of probabilistic domain models which ...
Yang Xiang, S. K. Michael Wong, Nick Cercone
103
Voted
ICMCS
2010
IEEE
168views Multimedia» more  ICMCS 2010»
15 years 3 months ago
Block-based image steganalysis for a multi-classifier
Traditional image steganalysis techniques for classification of steganograhic algorithms are conducted with respect to the entire image. In this work, we aim to design a multi-cla...
Seongho Cho, Jingwei Wang, C.-C. Jay Kuo, Byung-Ho...
CORR
2010
Springer
79views Education» more  CORR 2010»
15 years 2 months ago
Quantitative Games on Probabilistic Timed Automata
Abstract. Two-player zero-sum games are a well-established model for synthesising controllers that optimise some performance criterion. In such games one player represents the cont...
Marta Z. Kwiatkowska, Gethin Norman, Ashutosh Triv...
109
Voted
CORR
2006
Springer
90views Education» more  CORR 2006»
15 years 2 months ago
The recognizability of sets of graphs is a robust property
Once the set of finite graphs is equipped with an algebra structure (arising from the definition of operations that generalize the concatenation of words), one can define the noti...
Bruno Courcelle, Pascal Weil