DAM
1999
13 years 11 months ago
1999
An algorithm called Modoc", which has been introduced elsewhere, enhances propositional model elimination with autarky pruning, and other features. The model elimination meth...
ML
2000
ACM
13 years 11 months ago
2000
ACM
Capacity control in perceptron decision trees is typically performed by controlling their size. We prove that other quantities can be as relevant to reduce their flexibility and co...
ECCC
2002
13 years 11 months ago
2002
We shall give simpler proofs of some lower bounds on monotone computations. We describe a simple condition on combinatorial structures, such that the rank of the matrix associated...
COMBINATORICS
2000
13 years 11 months ago
2000
Bound polysemy is the property of any pair (G1, G2) of graphs on a shared vertex set V for which there exists a partial order on V such that any pair of vertices has an upper boun...
CORR
2004
Springer
13 years 11 months ago
2004
Springer
In this paper, we analyze the performance of space-time block codes which enable symbolwise maximum likelihood decoding. We derive an upper bound of maximum mutual information (MM...
LMCS
2007
13 years 11 months ago
2007
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
TSP
2008
13 years 11 months ago
2008
Abstract--This paper reports an upper bound for the Kullback
TCS
2008
13 years 11 months ago
2008
This paper presents strategies for improving the known upper and lower bounds for the bandwidth of Hamming graphs (Kn)d and [0, 1]d. Our labeling strategy lowers the upper bound o...
APIN
2005
13 years 11 months ago
2005
In this paper, we discuss the degeneration of relevance of uncertain temporal information and propose an analytical upper bound for the relevance time of information in a restrict...
APAL
2005
13 years 11 months ago
2005
Pudl