Sciweavers

14298 search results - page 2566 / 2860
» Dynamic Languages and Applications
Sort
View
ICALP
2007
Springer
16 years 24 days ago
Reconciling Data Compression and Kolmogorov Complexity
While data compression and Kolmogorov complexity are both about effective coding of words, the two settings differ in the following respect. A compression algorithm or compressor...
Laurent Bienvenu, Wolfgang Merkle
ICALP
2007
Springer
16 years 24 days ago
A Characterization of Non-interactive Instance-Dependent Commitment-Schemes (NIC)
Abstract. We provide a new characterization of certain zero-knowledge protocols as non-interactive instance-dependent commitment-schemes (NIC). To obtain this result we consider th...
Bruce M. Kapron, Lior Malka, Srinivasan Venkatesh
IFIP
2007
Springer
16 years 24 days ago
Extending GQM by Argument Structures
Effective methods for metrics definition are of particular importance, as measurement mechanisms are indispensable in virtually any engineering discipline. The paper describes how ...
Lukasz Cyra, Janusz Górski
LPNMR
2007
Springer
16 years 24 days ago
Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains
Recent research in answer-set programming (ASP) is concerned with the problem of finding faithful transformations of logic programs under the stable semantics. This is in particul...
Michael Fink, Reinhard Pichler, Hans Tompits, Stef...
MIDDLEWARE
2007
Springer
16 years 24 days ago
Rule-based reasoning about qualitative spatiotemporal relations
This paper is about a novel rule-based approach for reasoning about qualitative spatiotemporal relations among technology-rich autonomous objects, to which we refer to as artifact...
Clemens Holzmann
« Prev « First page 2566 / 2860 Last » Next »