Sciweavers

2661 search results - page 162 / 533
» Quantum Complexity Classes
Sort
View
DLOG
2010
15 years 1 months ago
Checking Full Satisfiability of Conceptual Models
Abstract. UML class diagrams (UCDs) are the de-facto standard formalism for the analysis and design of information systems. By adopting formal language techniques to capture constr...
Alessandro Artale, Diego Calvanese, Yazmin Ang&eac...
131
Voted
ALT
2006
Springer
16 years 11 days ago
Active Learning in the Non-realizable Case
Most of the existing active learning algorithms are based on the realizability assumption: The learner’s hypothesis class is assumed to contain a target function that perfectly c...
Matti Kääriäinen
115
Voted
COCO
2004
Springer
82views Algorithms» more  COCO 2004»
15 years 8 months ago
Dimension, Entropy Rates, and Compression
This paper develops new relationships between resource-bounded dimension, entropy rates, and compression. New tools for calculating dimensions are given and used to improve previo...
John M. Hitchcock, N. V. Vinodchandran
126
Voted
ISMIS
2005
Springer
15 years 9 months ago
Flexible Pattern Discovery with (Extended) Disjunctive Logic Programming
Abstract. The post-genomic era showed up a wide range of new challenging issues for the areas of knowledge discovery and intelligent information management. Among them, the discove...
Luigi Palopoli, Simona E. Rombo, Giorgio Terracina
ASIACRYPT
2006
Springer
15 years 7 months ago
The 2-Adic CM Method for Genus 2 Curves with Application to Cryptography
Abstract. The complex multiplication (CM) method for genus 2 is currently the most efficient way of generating genus 2 hyperelliptic curves defined over large prime fields and suit...
Pierrick Gaudry, T. Houtmann, D. Kohel, Christophe...