10988 search results - page 131 / 2198 » Algorithmic Folding Complexity |
159
click to vote
STOC
1995
ACM
15 years 10 months ago
1995
ACM
c communication case. This lemma generalizes and abstracts in a very clean form the ``round reduction'' techniques used in many previous lower bound proofs. ] 1998 Academ...
228
click to vote
ISAAC
2010
Springer
15 years 4 months ago
2010
Springer
We study line systems in metric spaces induced by graphs. A line is a subset of vertices defined by a relation of betweeness. We show that the class of all graphs having exactly k ...
165
click to vote
3DPH
2009
15 years 4 months ago
2009
We describe an algorithm for segmenting three-dimensional medical imaging data modeled as a continuous function on a 3-manifold. It is related to watershed algorithms developed in ...
146
click to vote
ISSAC
2004
Springer
15 years 11 months ago
2004
Springer
Many polynomial factorization algorithms rely on Hensel lifting and factor recombination. For bivariate polynomials we show that lifting the factors up to a precision linear in th...
158
click to vote
AAAI
2008
15 years 8 months ago
2008
Many real-world problems are characterized by complex relational structure, which can be succinctly represented in firstorder logic. However, many relational inference algorithms ...