Sciweavers

46 search results - page 4 / 10
» On the Complexity of Computing Short Linearly Independent Ve...
Sort
View
CORR
2008
Springer
123views Education» more  CORR 2008»
13 years 8 months ago
Networks become navigable as nodes move and forget
Abstract. We propose a dynamic process for network evolution, aiming at explaining the emergence of the small world phenomenon, i.e., the statistical observation that any pair of i...
Augustin Chaintreau, Pierre Fraigniaud, Emmanuelle...
BMCBI
2007
142views more  BMCBI 2007»
13 years 8 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
BIRTHDAY
2009
Springer
14 years 3 months ago
Is the World Linear?
Super-resolution is the art of creating nice high-resolution raster images from given low-resolution raster images. Since “nice” is not a well-defined term in mathematics and ...
Rudolf Fleischer
SDM
2009
SIAM
170views Data Mining» more  SDM 2009»
14 years 5 months ago
Mining Complex Spatio-Temporal Sequence Patterns.
Mining sequential movement patterns describing group behaviour in potentially streaming spatio-temporal data sets is a challenging problem. Movements are typically noisy and often...
Florian Verhein
CRYPTO
2000
Springer
175views Cryptology» more  CRYPTO 2000»
14 years 28 days ago
A Chosen-Ciphertext Attack against NTRU
We present a chosen-ciphertext attack against the public key cryptosystem called NTRU. This cryptosystem is based on polynomial algebra. Its security comes from the interaction of ...
Éliane Jaulmes, Antoine Joux