Sciweavers

3047 search results - page 567 / 610
» On the Meaning of Logical Completeness
Sort
View
BMCBI
2007
120views more  BMCBI 2007»
13 years 8 months ago
Quantitative sequence-function relationships in proteins based on gene ontology
Background: The relationship between divergence of amino-acid sequence and divergence of function among homologous proteins is complex. The assumption that homologs share function...
Vineet Sangar, Daniel J. Blankenberg, Naomi Altman...
CC
2007
Springer
121views System Software» more  CC 2007»
13 years 8 months ago
If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma
CN
2007
137views more  CN 2007»
13 years 8 months ago
AID: A global anti-DoS service
Distributed denial of service (DDoS) has long been an open security problem of the Internet. Most proposed solutions require the upgrade of routers across the Internet, which is e...
Shigang Chen, Yibei Ling, Randy Chow, Ye Xia
JAIR
2008
103views more  JAIR 2008»
13 years 8 months ago
SATzilla: Portfolio-based Algorithm Selection for SAT
It has been widely observed that there is no single "dominant" SAT solver; instead, different solvers perform best on different instances. Rather than following the trad...
Lin Xu, Frank Hutter, Holger H. Hoos, Kevin Leyton...
JCP
2006
139views more  JCP 2006»
13 years 8 months ago
Generalized Sequential Pattern Mining with Item Intervals
Sequential pattern mining is an important data mining method with broad applications that can extract frequent sequences while maintaining their order. However, it is important to ...
Yu Hirate, Hayato Yamana