5153 search results - page 501 / 1031 » Introduction to Randomized Algorithms |
178
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We study the problem of factoring univariate polynomials over finite fields. Under the assumption of the Extended Riemann Hypothesis (ERH), Gao [Gao01] designed a polynomial time ...
161
click to vote
CONNECTION
2006
15 years 6 months ago
2006
By learning a range of possible times over which the effect of an action can take place, a robot can reason more effectively about causal and contingent relationships in the world...
149
click to vote
COR
2007
15 years 6 months ago
2007
The paper discusses the definition and solution of a bi-objective routing problem, namely the bi-objective covering tour problem. The bi-objective CTP is a generalization of the ...
150
click to vote
NPL
2000
15 years 6 months ago
2000
Generative topographic mapping (GTM) is a statistical model to extract a hidden smooth manifold from data, like the self-organizing map (SOM). Although a deterministic search algo...
183
click to vote
EMNLP
2010
15 years 4 months ago
2010
Minimum Error Rate Training is the algorithm for log-linear model parameter training most used in state-of-the-art Statistical Machine Translation systems. In its original formula...