Sciweavers

6142 search results - page 268 / 1229
» The Complexity of Partition Functions
Sort
View
187
Voted
DC
2008
15 years 6 months ago
Approximate distributed top- k queries
We consider a distributed system where each node keeps a local count for items (similar to elections where nodes are ballot boxes and items are candidates). A top-k query in such ...
Boaz Patt-Shamir, Allon Shafrir
ICFP
2007
ACM
16 years 6 months ago
Termination analysis and call graph construction for higher-order functional programs
The analysis and verification of higher-order programs raises the issue of control-flow analysis for higher-order languages. The problem of constructing an accurate call graph for...
Damien Sereni
APBC
2004
116views Bioinformatics» more  APBC 2004»
15 years 7 months ago
Structure-Function Relationship in DNA Sequence Recognition by Transcription Factors
Transcription factors play essential role in the gene regulation in higher organisms, binding to multiple target sequences and regulating multiple genes in a complex manner. In or...
Akinori Sarai, Samuel Selvaraj, M. Michael Gromiha...
STOC
2010
ACM
200views Algorithms» more  STOC 2010»
16 years 3 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
BMCBI
2005
122views more  BMCBI 2005»
15 years 6 months ago
FACT - a framework for the functional interpretation of high-throughput experiments
Background: Interpreting the results of high-throughput experiments, such as those obtained from DNA-microarrays, is an often time-consuming task due to the high number of data-po...
Felix Kokocinski, Nicolas Delhomme, Gunnar Wrobel,...