Sciweavers

179 search results - page 10 / 36
» Space Bounded Computations: Review And New Separation Result...
Sort
View
74
Voted
DCC
2006
IEEE
15 years 10 months ago
Classification and Constructions of Complete Caps in Binary Spaces
We give new recursive constructions of complete caps in PG(n, 2). We approach the problem of constructing caps with low dependency via the doubling construction and comparison to ...
Mahdad Khatirinejad, Petr Lisonek
CORR
2002
Springer
166views Education» more  CORR 2002»
14 years 10 months ago
Quantum Time-Space Tradeoffs for Sorting
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...
Hartmut Klauck
BMCBI
2004
196views more  BMCBI 2004»
14 years 10 months ago
MUSCLE: a multiple sequence alignment method with reduced time and space complexity
Background: In a previous paper, we introduced MUSCLE, a new program for creating multiple alignments of protein sequences, giving a brief summary of the algorithm and showing MUS...
Robert C. Edgar
COCO
2007
Springer
114views Algorithms» more  COCO 2007»
15 years 4 months ago
Directed Planar Reachability is in Unambiguous Log-Space
We make progress in understanding the complexity of the graph reachability problem in the context of unambiguous logarithmic space computation; a restricted form of nondeterminism....
Chris Bourke, Raghunath Tewari, N. V. Vinodchandra...
PAMI
2002
103views more  PAMI 2002»
14 years 10 months ago
Digital Curves in 3D Space and a Linear-Time Length Estimation Algorithm
We consider simple digital curves in a 3D orthogonal grid as special polyhedrally bounded sets. These digital curves model digitized curves or arcs in three-dimensional euclidean ...
Thomas Bülow, Reinhard Klette