Sciweavers

9997 search results - page 1759 / 2000
» The case for crowd computing
Sort
View
RECOMB
2002
Springer
16 years 7 months ago
Discovering local structure in gene expression data: the order-preserving submatrix problem
This paper concerns the discovery of patterns in gene expression matrices, in which each element gives the expression level of a given gene in a given experiment. Most existing me...
Amir Ben-Dor, Benny Chor, Richard M. Karp, Zohar Y...
RECOMB
2002
Springer
16 years 7 months ago
Revealing protein structures: a new method for mapping antibody epitopes
A recent idea for determining the three-dimensional structure of a protein uses antibody recognition of surface structure and random peptide libraries to map antibody epitope comb...
Brendan Mumey, Brian W. Bailey, Edward A. Dratz
STOC
2007
ACM
83views Algorithms» more  STOC 2007»
16 years 7 months ago
Lattices that admit logarithmic worst-case to average-case connection factors
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
Chris Peikert, Alon Rosen
SIGMOD
2009
ACM
137views Database» more  SIGMOD 2009»
16 years 6 months ago
Robust and efficient algorithms for rank join evaluation
In the rank join problem we are given a relational join R1 1 R2 and a function that assigns numeric scores to the join tuples, and the goal is to return the tuples with the highes...
Jonathan Finger, Neoklis Polyzotis
SIGMOD
2009
ACM
140views Database» more  SIGMOD 2009»
16 years 6 months ago
Estimating the confidence of conditional functional dependencies
Conditional functional dependencies (CFDs) have recently been proposed as extensions of classical functional dependencies that apply to a certain subset of the relation, as specif...
Graham Cormode, Lukasz Golab, Flip Korn, Andrew Mc...
« Prev « First page 1759 / 2000 Last » Next »