Sciweavers

1404 search results - page 203 / 281
» Complexity of admissible rules
Sort
View
BIBE
2005
IEEE
121views Bioinformatics» more  BIBE 2005»
14 years 2 months ago
RNA Pseudoknot Prediction Using Term Rewriting
RNA plays a critical role in mediating every step of cellular information transfer from genes to functional proteins. Pseudoknots are widely occurring structural motifs found in a...
Xuezheng Fu, Hao Wang, William L. Harrison, Robert...
ESOP
2004
Springer
14 years 2 months ago
Resources, Concurrency, and Local Reasoning (Abstract)
t) Peter W. O’Hearn Queen Mary, University of London In the 1960s Dijkstra suggested that, in order to limit the complexity of potential process interactions, concurrent programs...
Peter W. O'Hearn
GPCE
2004
Springer
14 years 2 months ago
Taming Macros
Scheme includes a simple yet powerful macro mechanism. Using macros, programmers can easily extend the language with new kinds of expressions and definitions, thus abstracting ove...
Ryan Culpepper, Matthias Felleisen
WIDM
2003
ACM
14 years 2 months ago
Query rewriting using views in the presence of inclusion dependencies
Query rewriting using views is an essential issue in data integration. A number of algorithms, e.g., the bucket algorithm, the inverse rules algorithm, the SVB algorithm and the M...
Qingyuan Bai, Jun Hong, Michael F. McTear
IDEAL
2003
Springer
14 years 1 months ago
Detecting Distributed Denial of Service (DDoS) Attacks through Inductive Learning
As the complexity of Internet is scaled up, it is likely for the Internet resources to be exposed to Distributed Denial of Service (DDoS) flooding attacks on TCP-based Web servers....
Sanguk Noh, Cheolho Lee, Kyunghee Choi, Gihyun Jun...