Sciweavers

1162 search results - page 113 / 233
» An Information-Based Theory of Conditionals
Sort
View
ECML
1993
Springer
15 years 10 months ago
Complexity Dimensions and Learnability
In machine learning theory, problem classes are distinguished because of di erences in complexity. In 6 , a stochastic model of learning from examples was introduced. This PAClear...
Shan-Hwei Nienhuys-Cheng, Mark Polman
LICS
1992
IEEE
15 years 10 months ago
Equivalences on Observable Processes
The aim of this paper is to find the finest `observable' and `implementable' equivalence on concurrent processes. This is a part of a larger programme to develop a theor...
Irek Ulidowski
COLT
2007
Springer
15 years 10 months ago
An Efficient Re-scaled Perceptron Algorithm for Conic Systems
Abstract. The classical perceptron algorithm is an elementary algorithm for solving a homogeneous linear inequality system Ax > 0, with many important applications in learning t...
Alexandre Belloni, Robert M. Freund, Santosh Vempa...
CSB
2004
IEEE
106views Bioinformatics» more  CSB 2004»
15 years 10 months ago
A Theoretical Analysis of Gene Selection
A great deal of recent research has focused on the challenging task of selecting differentially expressed genes from microarray data (`gene selection'). Numerous gene selecti...
Sach Mukherjee, Stephen J. Roberts
DEON
2006
Springer
15 years 10 months ago
Strategic Deontic Temporal Logic as a Reduction to ATL, with an Application to Chisholm's Scenario
In this paper we extend earlier work on deontic deadlines in CTL to the framework of alternating time temporal logic (ATL). The resulting setting enables us to model several concep...
Jan Broersen