Sciweavers

459 search results - page 75 / 92
» Computational Complexity of Probabilistic Disambiguation
Sort
View
ICALP
2001
Springer
15 years 4 months ago
Secure Games with Polynomial Expressions
Abstract. We present the first private information retrieval (PIR) scheme which is both, deterministically correct and has poly-logarithmic communication complexity. Our PIR proto...
Aggelos Kiayias, Moti Yung
PODS
2000
ACM
146views Database» more  PODS 2000»
15 years 4 months ago
Analysis and Application of Adaptive Sampling
An estimation algorithm for a query is a probabilistic algorithm that computes an approximation for the size (number of tuples) of the query. One class of estimation algorithms us...
James F. Lynch
BIOCOMP
2007
15 years 1 months ago
Quality-Based Similarity Search for Biological Sequence Databases
Low-Complexity Regions (LCRs) of biological sequences are the main source of false positives in similarity searches for biological sequence databases. We consider the problem of ...
Xuehui Li, Tamer Kahveci
CIDR
2003
109views Algorithms» more  CIDR 2003»
15 years 1 months ago
SkyQuery: A Web Service Approach to Federate Databases
Traditional science searched for new objects and phenomena that led to discoveries. Tomorrow's science will combine together the large pool of information in scientific archi...
Tanu Malik, Alexander S. Szalay, Tamas Budavari, A...
NIPS
2004
15 years 1 months ago
Identifying Protein-Protein Interaction Sites on a Genome-Wide Scale
Protein interactions typically arise from a physical interaction of one or more small sites on the surface of the two proteins. Identifying these sites is very important for drug ...
Haidong Wang, Eran Segal, Asa Ben-Hur, Daphne Koll...