4860 search results - page 496 / 972 » SNPs Problems, Complexity, and Algorithms |
124
click to vote
COCOON
2010
Springer
15 years 9 months ago
2010
Springer
The persistent homology provides a mathematical tool to describe “features” in a principled manner. The persistence algorithm proposed by Edelsbrunner et al. [9] can compute n...
141
click to vote
ECML
2006
Springer
15 years 8 months ago
2006
Springer
Trees provide a suited structural representation to deal with complex tasks such as web information extraction, RNA secondary structure prediction, or conversion of tree structured...
162
click to vote
COCO
2008
Springer
15 years 6 months ago
2008
Springer
Discrepancy is a versatile bound in communication complexity which can be used to show lower bounds in the distributional, randomized, quantum, and even unbounded error models of ...
152
click to vote
COCO
2008
Springer
15 years 6 months ago
2008
Springer
We introduce a simple game family, called Constraint Logic, where players reverse edges in a directed graph while satisfying vertex in-flow constraints. This game family can be in...
143
click to vote
ALGORITHMICA
2010
15 years 4 months ago
2010
In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 : n]d . Our bound is near...