4860 search results - page 252 / 972 » SNPs Problems, Complexity, and Algorithms |
93
Voted
ICALP
2005
Springer
15 years 6 months ago
2005
Springer
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is ...
101
Voted
WABI
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. Comparing gene orders in completely sequenced genomes is a standard approach to locate clusters of functionally associated genes. Often, gene orders are modeled as permut...
108
click to vote
RSS
2007
15 years 2 months ago
2007
— We present an efficient algorithm to compute the generalized penetration depth (PDg) between rigid models. Given two overlapping objects, our algorithm attempts to compute the...
102
Voted
COCO
2007
Springer
15 years 4 months ago
2007
Springer
We prove new results on the circuit complexity of Approximate Majority, which is the problem of computing Majority of a given bit string whose fraction of 1's is bounded away...
132
click to vote
ICPR
2004
IEEE
16 years 1 months ago
2004
IEEE
The problem of eye detection in face images is very important for a large number of applications ranging from face recognition to gaze tracking. In this paper we propose a new alg...