Sciweavers

8486 search results - page 201 / 1698
» Ordered Enumeration Method
Sort
View
107
Voted
IJBC
2007
80views more  IJBC 2007»
15 years 2 months ago
Exact Approximations of omega Numbers
A Chaitin Omega number is the halting probability of a universal prefix-free Turing machine. Every Omega number is simultaneously computably enumerable (the limit of a computable...
Cristian S. Calude, Michael J. Dinneen
COMBINATORICS
2004
90views more  COMBINATORICS 2004»
15 years 2 months ago
Strings with Maximally Many Distinct Subsequences and Substrings
A natural problem in extremal combinatorics is to maximize the number of distinct subsequences for any length-n string over a finite alphabet ; this value grows exponentially, but...
Abraham Flaxman, Aram Wettroth Harrow, Gregory B. ...
103
Voted
CORR
2002
Springer
111views Education» more  CORR 2002»
15 years 2 months ago
The Fastest and Shortest Algorithm for All Well-Defined Problems
An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and loworder additive term...
Marcus Hutter
134
Voted
EMNLP
2009
15 years 12 days ago
Sinuhe - Statistical Machine Translation using a Globally Trained Conditional Exponential Family Translation Model
We present a new phrase-based conditional exponential family translation model for statistical machine translation. The model operates on a feature representation in which sentenc...
Matti Kääriäinen
131
Voted
AUTOMATICA
2011
14 years 6 months ago
Fast computation of minimal elementary decompositions of metabolic flux vectors
The concept of elementary flux vector is valuable in a number of applications of metabolic engineering. For instance, in metabolic flux analysis, each admissible flux vector ca...
Raphaël M. Jungers, Francisca Zamorano, Vince...