Sciweavers

120 search results - page 23 / 24
» From CTL to Datalog
Sort
View
ENTCS
2007
168views more  ENTCS 2007»
13 years 10 months ago
Bytecode Rewriting in Tom
In this paper, we present a term rewriting based library for manipulating Java bytecode. We define a mapping from bytecode programs to algebraic terms, and we use Tom, an extensi...
Emilie Balland, Pierre-Etienne Moreau, Antoine Rei...
BMCBI
2006
159views more  BMCBI 2006»
13 years 11 months ago
EpiJen: a server for multistep T cell epitope prediction
Background: The main processing pathway for MHC class I ligands involves degradation of proteins by the proteasome, followed by transport of products by the transporter associated...
Irini A. Doytchinova, Pingping Guan, Darren R. Flo...
ICDE
2011
IEEE
281views Database» more  ICDE 2011»
13 years 2 months ago
Declarative analysis of noisy information networks
—There is a growing interest in methods for analyzing data describing networks of all types, including information, biological, physical, and social networks. Typically the data ...
Walaa Eldin Moustafa, Galileo Namata, Amol Deshpan...
ICDE
1999
IEEE
151views Database» more  ICDE 1999»
15 years 6 days ago
Data Integration by Describing Sources with Constraint Databases
We develop a data integration approach for the efficient evaluation of queries over autonomous source databases. The approach is based on some novel applications and extensions of...
Xun Cheng, Guozhu Dong, Tzekwan Lau, Jianwen Su
ICALP
2007
Springer
14 years 5 months ago
Universal Algebra and Hardness Results for Constraint Satisfaction Problems
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
Benoit Larose, Pascal Tesson