Sciweavers

11160 search results - page 2179 / 2232
» Incompleteness in a General Setting
Sort
View
123
Voted
CORR
2002
Springer
95views Education» more  CORR 2002»
15 years 3 months ago
Unsupervised Learning of Morphology without Morphemes
The first morphological learner based upon the theory of Whole Word Morphology (Ford et al., 1997) is outlined, and preliminary evaluation results are presented. The program, Whol...
Sylvain Neuvel, Sean A. Fulop
178
Voted
CORR
2002
Springer
166views Education» more  CORR 2002»
15 years 3 months ago
Quantum Time-Space Tradeoffs for Sorting
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
Hartmut Klauck
119
Voted
ENTCS
2002
113views more  ENTCS 2002»
15 years 3 months ago
A monadic approach to polycategories
In the quest for an elegant formulation of the notion of "polycategory" we develop a more symmetric counterpart to Burroni's notion of "T-category", where ...
Jürgen Koslowski
217
Voted
ENTCS
2002
166views more  ENTCS 2002»
15 years 3 months ago
Translation and Run-Time Validation of Optimized Code
The paper presents approaches to the validation of optimizing compilers. The emphasis is on aggressive and architecture-targeted optimizations which try to obtain the highest perf...
Lenore D. Zuck, Amir Pnueli, Yi Fang, Benjamin Gol...
136
Voted
JACM
2000
77views more  JACM 2000»
15 years 3 months ago
The fault span of crash failures
A crashing network protocol is an asynchronous protocol whose memory does not survive crashes. We show that a crashing network protocol that works over unreliable links can be driv...
George Varghese, Mahesh Jayaram
« Prev « First page 2179 / 2232 Last » Next »