18306 search results - page 250 / 3662 » Algorithmics in Exponential Time |
161
click to vote
SMI
2005
IEEE
16 years 9 hour ago
2005
IEEE
This paper considers computation of visibility for twodimensional shapes whose boundaries are C1 continuous curves. We assume we are given a one-parameter family of candidate view...
151
click to vote
STOC
1997
ACM
15 years 10 months ago
1997
ACM
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...
199
click to vote
COCO
2004
Springer
15 years 10 months ago
2004
Springer
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
172
click to vote
BIRD
2008
Springer
15 years 8 months ago
2008
Springer
Finding motifs in biological sequences is one of the most intriguing problems for string algorithms designers due to, on the one hand, the numerous applications of this problem in...
187
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: Multiple sequence alignment is fundamental. Exponential growth in computation time appears to be inevitable when an optimal alignment is required for many sequences. E...