Sciweavers

618 search results - page 99 / 124
» Short cycle connectivity
Sort
View
APPROX
2004
Springer
121views Algorithms» more  APPROX 2004»
14 years 24 days ago
Small Pseudo-random Families of Matrices: Derandomizing Approximate Quantum Encryption
A quantum encryption scheme (also called private quantum channel, or state randomization protocol) is a one-time pad for quantum messages. If two parties share a classical random s...
Andris Ambainis, Adam Smith
STOC
2010
ACM
228views Algorithms» more  STOC 2010»
14 years 8 days ago
On the searchability of small-world networks with arbitrary underlying structure
Revisiting the “small-world” experiments of the ’60s, Kleinberg observed that individuals are very effective at constructing short chains of acquaintances between any two p...
Pierre Fraigniaud and George Giakkoupis
BMCBI
2007
142views more  BMCBI 2007»
13 years 7 months ago
SABERTOOTH: protein structural alignment based on a vectorial structure representation
Background: The task of computing highly accurate structural alignments of proteins in very short computation time is still challenging. This is partly due to the complexity of pr...
Florian Teichert, Ugo Bastolla, Markus Porto
NAR
2002
109views more  NAR 2002»
13 years 7 months ago
The Molecular Biology Database Collection: 2002 update
The Molecular Biology Database Collection is an online resource listing key databases of value to the biological community. This Collection is intended to bring fellow scientists&...
Andreas D. Baxevanis
LOGCOM
2010
152views more  LOGCOM 2010»
13 years 2 months ago
Constructive Logic with Strong Negation as a Substructural Logic
Gentzen systems are introduced for Spinks and Veroff's substructural logic corresponding to constructive logic with strong negation, and some logics in its vicinity. It has b...
Manuela Busaniche, Roberto Cignoli