Sciweavers

124 search results - page 17 / 25
» Calculating cyclotomic polynomials
Sort
View
EMNLP
2008
13 years 9 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
ISTA
2007
13 years 9 months ago
Game Theory-based Data Mining Technique for Strategy Making of a Soccer Simulation Coach Agent
: Soccer simulation is an effort to motivate researchers to perform artificial and robotic intelligence investigations in a multi-agent system framework. In this paper, we propose ...
Amin Milani Fard, Vahid Salmani, Mahmoud Naghibzad...
NIPS
1993
13 years 9 months ago
Fast Pruning Using Principal Components
We present a new algorithm for eliminating excess parameters and improving network generalization after supervised training. The method, \Principal Components Pruning (PCP)",...
Asriel U. Levin, Todd K. Leen, John E. Moody
CORR
2008
Springer
74views Education» more  CORR 2008»
13 years 7 months ago
Analysis of the Karmarkar-Karp Differencing Algorithm
The Karmarkar-Karp differencing algorithm is the best known polynomial time heuristic for the number partitioning problem, fundamental in both theoretical computer science and stat...
Stefan Boettcher, Stephan Mertens
CPHYSICS
2006
103views more  CPHYSICS 2006»
13 years 7 months ago
A band factorization technique for transition matrix element asymptotics
A new method of evaluating transition matrix elements between wave functions associated with orthogonal polynomials is proposed. The technique relies on purely algebraic manipulat...
Emmanuel Perrey-Debain, I. David Abrahams