5964 search results - page 104 / 1193 » A theory of speculative computation |
155
Voted
BIRTHDAY
2008
Springer
15 years 6 months ago
2008
Springer
The unfolding of a system represents in a single branching structure all its possible computations: it is the cornerstone both of semantical constructions and of efficient partial ...
144
Voted
DLT
2003
15 years 6 months ago
2003
In recent years generalized acceptance criteria for different nondeterministic computation models have been examined. Instead of the common definition where an input word is said...
131
click to vote
ECCV
2000
Springer
16 years 6 months ago
2000
Springer
The Singular Value Decomposition (SVD) of a matrix is a linear algebra tool that has been successfully applied to a wide variety of domains. The present paper is concerned with the...
137
Voted
RECOMB
2006
Springer
16 years 4 months ago
2006
Springer
Abstract. The understanding of genome rearrangements is an important endeavor in comparative genomics. A major computational problem in this field is finding a shortest sequence of...
140
click to vote
ARITH
1997
IEEE
15 years 8 months ago
1997
IEEE
In this paper we present a rigorous theoretical analysis of the main properties of a double base number system, using bases 2 and 3; in particular we emphasize the sparseness of t...