Sciweavers

451 search results - page 71 / 91
» On Parameterized Exponential Time Complexity
Sort
View
STOC
2009
ACM
133views Algorithms» more  STOC 2009»
16 years 3 months ago
New direct-product testers and 2-query PCPs
The "direct product code" of a function f gives its values on all k-tuples (f(x1), . . . , f(xk)). This basic construct underlies "hardness amplification" in c...
Russell Impagliazzo, Valentine Kabanets, Avi Wigde...
150
Voted
PODS
2008
ACM
109views Database» more  PODS 2008»
16 years 2 months ago
Time-decaying aggregates in out-of-order streams
Processing large data streams is now a major topic in data management. The data involved can be truly massive, and the required analyses complex. In a stream of sequential events ...
Graham Cormode, Flip Korn, Srikanta Tirthapura
147
Voted
CF
2007
ACM
15 years 6 months ago
Parallel genomic sequence-search on a massively parallel system
In the life sciences, genomic databases for sequence search have been growing exponentially in size. As a result, faster sequencesearch algorithms to search these databases contin...
Oystein Thorsen, Brian E. Smith, Carlos P. Sosa, K...
134
Voted
BMCBI
2007
143views more  BMCBI 2007»
15 years 2 months ago
An adaptive bin framework search method for a beta-sheet protein homopolymer model
Background: The problem of protein structure prediction consists of predicting the functional or native structure of a protein given its linear sequence of amino acids. This probl...
Alena Shmygelska, Holger H. Hoos
CVPR
2007
IEEE
16 years 4 months ago
Efficient Belief Propagation for Vision Using Linear Constraint Nodes
Belief propagation over pairwise connected Markov Random Fields has become a widely used approach, and has been successfully applied to several important computer vision problems....
Brian Potetz