19700 search results - page 200 / 3940 » DNA-Based Computation Times |
118
click to vote
ERSA
2006
15 years 6 months ago
2006
: A brief review of mapping generalized template matching operations onto reconfigurable computers is given. A combinatorial optimization process, where the objective is to minimiz...
131
click to vote
SIGCSE
1995
ACM
15 years 9 months ago
1995
ACM
Students get more out of an interactive lecture than a passive lecture because they are given time to think. This time allows them to determine if they understand a concept, and i...
153
click to vote
CADE
2008
Springer
15 years 7 months ago
2008
Springer
Recent studies have provided many characterisations of the class of polynomial time computable functions through term rewriting techniques. In this paper we describe a (fully autom...
162
click to vote
COMPGEOM
1994
ACM
15 years 9 months ago
1994
ACM
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...
124
click to vote
ISAAC
2009
Springer
15 years 12 months ago
2009
Springer
Abstract. The theory of multidimensional persistence captures the topology of a multifiltration – a multiparameter family of increasing spaces. Multifiltrations arise naturally...