Sciweavers

3713 search results - page 256 / 743
» Quantum Information Theory
Sort
View
CAI
2007
Springer
14 years 5 months ago
From Algebraic Graph Transformation to Adhesive HLR Categories and Systems
In this paper, we present an overview of algebraic graph transformation in the double pushout approach. Basic results concerning independence, parallelism, concurrency, embedding, ...
Ulrike Prange, Hartmut Ehrig
ISCIS
2004
Springer
14 years 4 months ago
Proof of the Basic Theorem on Concept Lattices in Isabelle/HOL
This paper presents a machine-checked proof of the Basic Theorem on Concept Lattices, which appears in the book “Formal Concept Analysis” by Ganter and Wille, in the Isabelle/H...
Baris Sertkaya, Halit Oguztüzün
ICALP
1999
Springer
14 years 3 months ago
Average-Case Complexity of Shellsort
We demonstrate an ⍀( pn1ϩ1/p) lower bound on the average-case running time (uniform distribution) of p-pass Shellsort. This is the first nontrivial general lower bound for avera...
Tao Jiang, Ming Li, Paul M. B. Vitányi
ECAI
1992
Springer
14 years 2 months ago
Phenomenology, Representations and Complexity
Abstract. The paper refutes the general phenomenological argument that knowledge cannot be completely represented by symbols and, hence, symbolic AI does not work. Moreover, the vi...
Achim G. Hoffmann
ALT
2010
Springer
14 years 9 days ago
Bayesian Active Learning Using Arbitrary Binary Valued Queries
We explore a general Bayesian active learning setting, in which the learner can ask arbitrary yes/no questions. We derive upper and lower bounds on the expected number of queries r...
Liu Yang, Steve Hanneke, Jaime G. Carbonell