1092 search results - page 109 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
183
click to vote
ICGI
2010
Springer
15 years 7 months ago
2010
Springer
We recapitulate regular one-shot learning from membership and equivalence queries, positive and negative finite data. We present a meta-algorithm that generalizes over as many sett...
180
Voted
RECOMB
2004
Springer
16 years 6 months ago
2004
Springer
The prediction of translation initiation sites (TISs) in eukaryotic mRNAs has been a challenging problem in computational molecular biology. In this paper, we present a new algori...
156
Voted
DAGSTUHL
2007
15 years 7 months ago
2007
Abstract. Well-founded orders are the most basic, but also most important ingredient to virtually all termination analyses. Numerous fully automated search algorithms for these cla...
179
click to vote
EUROGRAPHICS
2010
Eurographics
16 years 1 months ago
2010
Eurographics
Higher-order finite element methods have emerged as an important discretization scheme for simulation. They are increasingly used in contemporary numerical solvers, generating a ...
152
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...