Sciweavers

7773 search results - page 1359 / 1555
» On generalized Frame-Stewart numbers
Sort
View
JCSS
2000
116views more  JCSS 2000»
15 years 6 months ago
Time-Space Tradeoffs for Satisfiability
We give the first nontrivial model-independent time-space tradeoffs for satisfiability. Namely, we show that SAT cannot be solved simultaneously in n1+o(1) time and n1space for an...
Lance Fortnow
JGAA
2000
85views more  JGAA 2000»
15 years 6 months ago
Techniques for the Refinement of Orthogonal Graph Drawings
Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the quality of orthogonal drawings can be significantly improved with a ...
Janet M. Six, Konstantinos G. Kakoulis, Ioannis G....
MST
2000
101views more  MST 2000»
15 years 6 months ago
Robust Parallel Computations through Randomization
In this paper we present an efficient general simulation strategy for computations designed for fully operational BSP machines of n ideal processors, on n-processor dynamic-fault-p...
Spyros C. Kontogiannis, Grammati E. Pantziou, Paul...
NAR
2000
128views more  NAR 2000»
15 years 6 months ago
The IMB Jena Image Library of Biological Macromolecules
The IMB Jena Image Library of Biological Macromolecules (http://www.imb-jena.de/IMAGE.html ) is aimed at a better dissemination of information on three-dimensional biopolymer stru...
Jan Reichert, Andreas Jabs, Peter Slickers, Jü...
COMGEO
1998
ACM
15 years 6 months ago
The union of moving polygonal pseudodiscs - Combinatorial bounds and applications
Let P be a set of polygonal pseudodiscs in the plane with n edges in total translating with xed velocities in xed directions. We prove that the maximumnumber of combinatorial chan...
Mark de Berg, Hazel Everett, Leonidas J. Guibas
« Prev « First page 1359 / 1555 Last » Next »