2127 search results - page 162 / 426 » Computing large matchings fast |
135
click to vote
BMCBI
2010
15 years 4 months ago
2010
Background: Improving the accuracy and efficiency of motif recognition is an important computational challenge that has application to detecting transcription factor binding sites...
127
Voted
BMCBI
2007
15 years 4 months ago
2007
Background: Genome assemblers have grown very large and complex in response to the need for algorithms to handle the challenges of large whole-genome sequencing projects. Many of ...
111
click to vote
PODC
1996
ACM
15 years 8 months ago
1996
ACM
Drawing ideas from previous authors, we present a new non-blocking concurrent queue algorithm and a new twolock queue algorithm in which one enqueue and one dequeue can proceed co...
168
click to vote
GRID
2006
Springer
15 years 4 months ago
2006
Springer
Discovery of large amounts of idle CPUs in fully distributed and shared Grid systems is needed in relevant applications and is still a challenging problem. In this paper we present...
151
click to vote
CGF
2002
15 years 4 months ago
2002
This paper introduces a fast continuous collision detection technique for polyhedral rigid bodies. As opposed to most collision detection techniques, the computation of the first ...