Sciweavers

5316 search results - page 974 / 1064
» Which Search Problems Are Random
Sort
View
FOCS
1992
IEEE
15 years 7 months ago
Fault-tolerant Wait-free Shared Objects
Wait-free implementations of shared objects tolerate the failure of processes, but not the failure of base objects from which they are implemented. We consider the problem of imple...
Prasad Jayanti, Tushar Deepak Chandra, Sam Toueg
123
Voted
STOC
1993
ACM
117views Algorithms» more  STOC 1993»
15 years 7 months ago
Efficient noise-tolerant learning from statistical queries
In this paper, we study the problem of learning in the presence of classification noise in the probabilistic learning model of Valiant and its variants. In order to identify the cl...
Michael J. Kearns
162
Voted
CTRSA
2009
Springer
141views Cryptology» more  CTRSA 2009»
15 years 7 months ago
Practical Short Signature Batch Verification
In many applications, it is desirable to work with signatures that are both short, and yet where many messages from different signers be verified very quickly. RSA signatures sati...
Anna Lisa Ferrara, Matthew Green, Susan Hohenberge...
126
Voted
CIBCB
2006
IEEE
15 years 7 months ago
Efficient Probe Selection in Microarray Design
Abstract-- The DNA microarray technology, originally developed to measure the level of gene expression, had become one of the most widely used tools in genomic study. Microarrays h...
Leszek Gasieniec, Cindy Y. Li, Paul Sant, Prudence...
124
Voted
IADIS
2008
15 years 5 months ago
Sisa: Seeded Iterative Signature Algorithm for Biclustering Gene Expression Data
One approach to reduce the complexity of the task in the analysis of large scale genome-wide expression is to group the genes showing similar expression patterns into what are cal...
Neelima Gupta, Seema Aggarwal