Sciweavers

587 search results - page 95 / 118
» On the Relative Sizes of Learnable Sets
Sort
View
98
Voted
BMCBI
2004
119views more  BMCBI 2004»
14 years 9 months ago
Identification of polymorphic tandem repeats by direct comparison of genome sequence from different bacterial strains : a web-ba
Background: Polymorphic tandem repeat typing is a new generic technology which has been proved to be very efficient for bacterial pathogens such as B. anthracis, M. tuberculosis, ...
France Denoeud, Gilles Vergnaud
BMCBI
2011
14 years 1 months ago
Structator: fast index-based search for RNA sequence-structure patterns
Background: The secondary structure of RNA molecules is intimately related to their function and often more conserved than the sequence. Hence, the important task of searching dat...
Fernando Meyer, Stefan Kurtz, Rolf Backofen, Sebas...
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
15 years 10 months ago
Non-malleable extractors and symmetric key cryptography from weak secrets
We study the question of basing symmetric key cryptography on weak secrets. In this setting, Alice and Bob share an n-bit secret W, which might not be uniformly random, but the ad...
Yevgeniy Dodis, Daniel Wichs
70
Voted
PERCOM
2004
ACM
15 years 9 months ago
Augmenting Film and Video Footage with Sensor Data
With the advent of tiny networked devices, Mark Weiser's vision of a world embedded with invisible computers is coming to age. Due to their small size and relative ease of dep...
Norman Makoto Su, Heemin Park, Eric Bostrom, Jeff ...
85
Voted
ICALP
2005
Springer
15 years 3 months ago
Computational Bounds on Hierarchical Data Processing with Applications to Information Security
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
Roberto Tamassia, Nikos Triandopoulos