Sciweavers

480 search results - page 87 / 96
» Algorithmic tests and randomness with respect to a class of ...
Sort
View
STOC
2010
ACM
200views Algorithms» more  STOC 2010»
14 years 4 months ago
Hardness Amplification in Proof Complexity
We present a generic method for converting any family of unsatisfiable CNF formulas that require large resolution rank into CNF formulas whose refutation requires large rank for p...
Paul Beame, Trinh Huynh and Toniann Pitassi
ISCA
2005
IEEE
101views Hardware» more  ISCA 2005»
14 years 1 months ago
Near-Optimal Worst-Case Throughput Routing for Two-Dimensional Mesh Networks
Minimizing latency and maximizing throughput are important goals in the design of routing algorithms for interconnection networks. Ideally, we would like a routing algorithm to (a...
Daeho Seo, Akif Ali, Won-Taek Lim, Nauman Rafique,...
BMCBI
2006
100views more  BMCBI 2006»
13 years 7 months ago
Using the nucleotide substitution rate matrix to detect horizontal gene transfer
Background: Horizontal gene transfer (HGT) has allowed bacteria to evolve many new capabilities. Because transferred genes perform many medically important functions, such as conf...
Micah Hamady, M. D. Betterton, Rob Knight
RECOMB
2003
Springer
14 years 7 months ago
Physical network models and multi-source data integration
We develop a new framework for inferring models of transcriptional regulation. The models in this approach, which we call physical models, are constructed on the basis of verifiab...
Chen-Hsiang Yeang, Tommi Jaakkola
KDD
2009
ACM
167views Data Mining» more  KDD 2009»
14 years 2 months ago
Anomalous window discovery through scan statistics for linear intersecting paths (SSLIP)
Anomalous windows are the contiguous groupings of data points. In this paper, we propose an approach for discovering anomalous windows using Scan Statistics for Linear Intersectin...
Lei Shi, Vandana Pursnani Janeja