4860 search results - page 462 / 972 » SNPs Problems, Complexity, and Algorithms |
125
click to vote
ACL
1994
15 years 5 months ago
1994
This paper presents a statistical decision procedure for lexical ambiguity resolution. The algorithm exploits both local syntactic patterns and more distant collocational evidence...
133
Voted
CORR
2008
Springer
15 years 4 months ago
2008
Springer
We study the problem of factoring univariate polynomials over finite fields. Under the assumption of the Extended Riemann Hypothesis (ERH), Gao [Gao01] designed a polynomial time ...
116
Voted
JCB
2008
15 years 4 months ago
2008
Given a metabolic network in terms of its metabolites and reactions, our goal is to efficiently compute the minimal knock out sets of reactions required to block a given behaviour....
154
click to vote
PAMI
2007
15 years 3 months ago
2007
—A new parameter-free graph-morphology-based segmentation algorithm is proposed to address the problem of partitioning a 3D triangular mesh into disjoint submeshes that correspon...
146
click to vote
ECCV
2008
Springer
16 years 5 months ago
2008
Springer
Abstract. In this paper we present a new approach for establishing correspondences between sparse image features related by an unknown non-rigid mapping and corrupted by clutter an...