Sciweavers

EJC
1998
13 years 8 months ago
On the Capacity of Digraphs
For a digraph G = (V, E) let w(Gn ) denote the maximum possible cardinality of a subset S of V n in which for every ordered pair (u1, u2, . . . , un) and (v1, v2, . . . , vn) of m...
Noga Alon
EJC
1998
13 years 8 months ago
The Intersection Theorem for Direct Products
Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khac...
CAI
1998
Springer
13 years 8 months ago
Information Retrieval, Imaging and Probabilistic Logic
Abstract. Imaging is a class of non-Bayesian methods for the revision of probability density functions originally proposed as a semantics for conditional logic. Two of these revisi...
Fabrizio Sebastiani
CAI
1998
Springer
13 years 8 months ago
Structured Plans with Sharing and Replication
Mira Balaban, Solomon Eyal Shimony
EJC
2002
13 years 8 months ago
On Line Arrangements in the Hyperbolic Plane
Andreas W. M. Dress, Jack H. Koolen, Vincent Moult...
IDA
2002
Springer
13 years 8 months ago
Classification and filtering of spectra: A case study in mineralogy
The ability to identify the mineral composition of rocks and soils is an important tool for the exploration of geological sites. Even though expert knowledge is commonly used for t...
Jonathan Moody, Ricardo Bezerra de Andrade e Silva...
IDA
2002
Springer
13 years 8 months ago
Boosting strategy for classification
This paper introduces a strategy for training ensemble classifiers by analysing boosting within margin theory. We present a bound on the generalisation error of ensembled classifi...
Huma Lodhi, Grigoris J. Karakoulas, John Shawe-Tay...
IDA
2002
Springer
13 years 8 months ago
Online classification of nonstationary data streams
Most classification methods are based on the assumption that the data conforms to a stationary distribution. However, the real-world data is usually collected over certain periods...
Mark Last