Sciweavers

860 search results - page 137 / 172
» Lower Bounds on the Size of Test Data Sets
Sort
View
BMCBI
2005
106views more  BMCBI 2005»
13 years 7 months ago
Thesaurus-based disambiguation of gene symbols
Background: Massive text mining of the biological literature holds great promise of relating disparate information and discovering new knowledge. However, disambiguation of gene s...
Bob J. A. Schijvenaars, Barend Mons, Marc Weeber, ...
NDSS
2008
IEEE
14 years 2 months ago
Usable PIR
In [22] we showed that existing single-server computational private information retrieval (PIR) protocols for the purpose of preserving client access patterns leakage are orders o...
Peter Williams, Radu Sion
BMCBI
2006
116views more  BMCBI 2006»
13 years 7 months ago
Whole genome association mapping by incompatibilities and local perfect phylogenies
Background: With current technology, vast amounts of data can be cheaply and efficiently produced in association studies, and to prevent data analysis to become the bottleneck of ...
Thomas Mailund, Søren Besenbacher, Mikkel H...
ISW
2007
Springer
14 years 1 months ago
New Weaknesses in the Keystream Generation Algorithms of the Stream Ciphers TPy and Py
The stream ciphers Py, Py6 designed by Biham and Seberry were promising candidates in the ECRYPT-eSTREAM project because of their impressive speed. Since their publication in Apri...
Gautham Sekar, Souradyuti Paul, Bart Preneel
IGIS
1994
145views GIS» more  IGIS 1994»
13 years 11 months ago
Approximations for a Multi-Step Processing of Spatial Joins
The basic concept for processing spatial joins consists of two steps: First, the spatial join is performed on the minimum bounding rectangles of the objects by using a spatial acce...
Thomas Brinkhoff, Hans-Peter Kriegel