Sciweavers

2841 search results - page 65 / 569
» A Call to Order
Sort
View
DLOG
2004
14 years 11 months ago
Efficient Reasoning with Range and Domain Constraints
We show how a tableaux algorithm for SHIQ can be extended to support role boxes that include range and domain axioms, prove that the extended algorithm is still a decision procedur...
Dmitry Tsarkov, Ian Horrocks
LOPSTR
2004
Springer
15 years 3 months ago
Proving Termination for Logic Programs by the Query-Mapping Pairs Approach
This paper describes a method for proving termination of to logic programs based on abstract interpretation. The method ry-mapping pairs to abstract the relation between calls in t...
Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Ser...
EUROPAR
2009
Springer
14 years 7 months ago
Argument Controlled Profiling
Profiling tools relate measurements to code context such as function names in order to guide code optimization. For a more detailed analysis, call path or phase-based profiling enh...
Tilman Küstner, Josef Weidendorfer, Tobias We...
FSE
2001
Springer
116views Cryptology» more  FSE 2001»
15 years 2 months ago
NESSIE: A European Approach to Evaluate Cryptographic Algorithms
The NESSIE project (New European Schemes for Signature, Integrity and Encryption) intends to put forward a portfolio containing the next generation of cryptographic primitives. The...
Bart Preneel
RECOMB
2001
Springer
15 years 2 months ago
The greedy path-merging algorithm for sequence assembly
Two different approaches to determining the human genome are currently being pursued: one is the “clone-by-clone” approach, employed by the publicly-funded Human Genome Proje...
Daniel H. Huson, Knut Reinert, Eugene W. Myers