10608 search results - page 340 / 2122 » Complexity of O'Hara's Algorithm |
110
click to vote
AIEDAM
2008
15 years 26 days ago
2008
Although it is known that quantum computers can solve certain computational problems exponentially faster than classical computers, only a small number of quantum algorithms have ...
97
Voted
CORR
2008
Springer
15 years 25 days ago
2008
Springer
Abstract. We develop a statistical mechanical interpretation of algorithmic information theory by introducing the notion of thermodynamic quantities, such as free energy, energy, s...
CORR
2010
Springer
15 years 25 days ago
2010
Springer
-- Electing leader is a vital issue not only in distributed computing but also in communication network [1, 2, 3, 4, 5], centralized mutual exclusion algorithm [6, 7], centralized ...
106
Voted
COLING
2010
14 years 7 months ago
2010
In statistical machine translation, decoding without any reordering constraint is an NP-hard problem. Inversion Transduction Grammars (ITGs) exploit linguistic structure and can w...
102
Voted
JMLR
2010
14 years 7 months ago
2010
Logic-based probabilistic models (LBPMs) enable us to handle problems with uncertainty succinctly thanks to the expressive power of logic. However, most of LBPMs have restrictions...