814 search results - page 73 / 163 » Machine Translation by Case Generalization |
108
click to vote
ESA
2003
Springer
15 years 8 months ago
2003
Springer
In [2] it was shown that the obvious semi-clairvoyant generalization of the Shortest Processing Time is O(1)-competitive with respect to average stretch on a single machine. In [2...
119
click to vote
COLT
2000
Springer
15 years 7 months ago
2000
Springer
Output coding is a general framework for solving multiclass categorization problems. Previous research on output codes has focused on building multiclass machines given predefine...
148
Voted
ENTCS
2006
15 years 3 months ago
2006
It is reasonable to assume that quantum computations take place under the control of the classical world. For modelling this standard situation, we introduce a Classically-control...
116
Voted
IJBC
2007
15 years 3 months ago
2007
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...
127
Voted
MST
2000
15 years 3 months ago
2000
In this paper we present an efficient general simulation strategy for computations designed for fully operational BSP machines of n ideal processors, on n-processor dynamic-fault-p...