Sciweavers

12459 search results - page 115 / 2492
» cans 2006
Sort
View
JAR
1998
60views more  JAR 1998»
13 years 9 months ago
Elimination of Self-Resolving Clauses
It is shown how self-resolving clauses like symmetry or transitivity, or even clauses like condensed detachment, can faithfully be deleted from the clause set thus eliminating or ...
Hans Jürgen Ohlbach
JLP
2002
90views more  JLP 2002»
13 years 9 months ago
Combining programs and state machines
State machines consume and process actions complementary to programs issuing actions. State machines maintain a state and reply with a boolean response to each action in their int...
Jan A. Bergstra, Alban Ponse
JMIV
2002
74views more  JMIV 2002»
13 years 9 months ago
A Filter To Remove Gaussian Noise by Clustering the Gray Scale
An algorithm to suppress Gaussian noise is presented, based on clustering (grouping) gray levels. The histogram of a window sliding across the image is divided into clusters, and t...
Zakaria Atae-Allah, José-Martínez Ar...
JMLR
2002
75views more  JMLR 2002»
13 years 9 months ago
Stability and Generalization
We define notions of stability for learning algorithms and show how to use these notions to derive generalization error bounds based on the empirical error and the leave-one-out e...
Olivier Bousquet, André Elisseeff
JOLLI
2002
125views more  JOLLI 2002»
13 years 9 months ago
Some Notes on the Formal Properties of Bidirectional Optimality Theory
In this paper, we discuss some formal properties of the model of bidirectional Optimality Theory that was developed in Blutner 2000. We investigate the conditions under which bidi...
Gerhard Jäger