3171 search results - page 343 / 635 » Application of Reduce Order Modeling to Time Parallelization |
141
click to vote
ISCAS
1999
IEEE
15 years 8 months ago
1999
IEEE
The bigraph crossing problem, embedding the two node sets of a bipartite graph G = V0;V1;E along two parallel lines so that edge crossings are minimized, has application to placeme...
163
click to vote
MLDM
2009
Springer
15 years 11 months ago
2009
Springer
We face the problem of novelty detection from stream data, that is, the identification of new or unknown situations in an ordered sequence of objects which arrive on-line, at cons...
129
click to vote
COCO
2004
Springer
15 years 8 months ago
2004
Springer
Juedes and Lutz (1995) proved a small span theorem for polynomial-time many-one reductions in exponential time. This result says that for language A decidable in exponential time,...
142
click to vote
BICOB
2009
Springer
15 years 11 months ago
2009
Springer
The de novo assembly of genomes from high-throughput short reads is an active area of research. Several promising methods have been recently developed, with applicability mainly re...
133
click to vote
PODS
1995
ACM
15 years 8 months ago
1995
ACM
d abstract Marc Andries, Leiden University Luca Cabibbo, University of Romey Jan Paredaens, University of Antwerpz Jan Van den Bussche, INRIAx In the context of object databases...