Sciweavers

1419 search results - page 249 / 284
» Power Droop Testing
Sort
View
RECOMB
2005
Springer
16 years 3 days ago
Improved Pattern-Driven Algorithms for Motif Finding in DNA Sequences
Abstract. In order to guarantee that the optimal motif is found, traditional pattern-driven approaches perform an exhaustive search over all candidate motifs of length l. We develo...
Sing-Hoi Sze, Xiaoyan Zhao
RECOMB
2002
Springer
16 years 3 days ago
Inferring Piecewise Ancestral History from Haploid Sequences
There has been considerable recent interest in the use of haplotype structure to aid in the design and analysis of case-control association studies searching for genetic predictors...
Russell Schwartz, Andrew G. Clark, Sorin Istrail
STOC
2007
ACM
111views Algorithms» more  STOC 2007»
16 years 3 days ago
Low-end uniform hardness vs. randomness tradeoffs for AM
In 1998, Impagliazzo and Wigderson [IW98] proved a hardness vs. randomness tradeoff for BPP in the uniform setting, which was subsequently extended to give optimal tradeoffs for t...
Ronen Shaltiel, Christopher Umans
VLDB
2007
ACM
155views Database» more  VLDB 2007»
16 years 1 days ago
Towards Graph Containment Search and Indexing
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g D such that q contains g (q g). Due to the wide adoption of graph models, f...
Chen Chen, Xifeng Yan, Philip S. Yu, Jiawei Han, D...
SIGMOD
2004
ACM
126views Database» more  SIGMOD 2004»
15 years 12 months ago
Indexing Spatio-Temporal Trajectories with Chebyshev Polynomials
In this paper, we attempt to approximate and index a ddimensional (d 1) spatio-temporal trajectory with a low order continuous polynomial. There are many possible ways to choose ...
Yuhan Cai, Raymond T. Ng