Sciweavers

1998 search results - page 110 / 400
» Complexity of the Cover Polynomial
Sort
View
ILP
2003
Springer
14 years 3 months ago
Complexity Parameters for First-Order Classes
We study several complexity parameters for first order formulas and their suitability for first order learning models. We show that the standard notion of size is not captured by...
Marta Arias, Roni Khardon
EMNLP
2008
13 years 11 months ago
Complexity of Finding the BLEU-optimal Hypothesis in a Confusion Network
Confusion networks are a simple representation of multiple speech recognition or translation hypotheses in a machine translation system. A typical operation on a confusion network...
Gregor Leusch, Evgeny Matusov, Hermann Ney
CSREAESA
2004
13 years 11 months ago
CMOS Implementation of Phase-Encoded Complex-Valued Artificial Neural Networks
- The model of a simple perceptron using phase-encoded inputs and complex-valued weights is presented. Multilayer two-input and three-input complex-valued neurons (CVNs) are implem...
Howard E. Michel, David Rancour, Sushanth Iringent...
IJCAI
1997
13 years 11 months ago
Computational Complexity of Multi-way, Dataflow Constraint Problems
Although it is acknowledged that multi-way dataflow constraints are useful in interactive applications, concerns about their tractability have hindered their acceptance. Certain l...
Gilles Trombettoni, Bertrand Neveu
FSTTCS
2008
Springer
13 years 11 months ago
Analyzing the Implicit Computational Complexity of object-oriented programs
A sup-interpretation is a tool which provides upper bounds on the size of the values computed by the function symbols of a program. Sup-interpretations have shown their interest to...
Jean-Yves Marion, Romain Péchoux