Sciweavers

1007 search results - page 26 / 202
» The Complexity of Futile Questioning
Sort
View
COLT
2001
Springer
14 years 2 months ago
Intrinsic Complexity of Learning Geometrical Concepts from Positive Data
Intrinsic complexity is used to measure the complexity of learning areas limited by broken-straight lines (called open semi-hulls) and intersections of such areas. Any strategy le...
Sanjay Jain, Efim B. Kinber
STOC
1991
ACM
93views Algorithms» more  STOC 1991»
14 years 1 months ago
Rounds in Communication Complexity Revisited
The k-round two-party communication complexity was studied in the deterministic model by [14] and [4] and in the probabilistic model by [20] and [6]. We present new lower bounds th...
Noam Nisan, Avi Wigderson
AAAI
2007
13 years 12 months ago
Complexity Boundaries for Horn Description Logics
Horn description logics (Horn-DLs) have recently started to attract attention due to the fact that their (worst-case) data complexities are in general lower than their overall (i....
Markus Krötzsch, Sebastian Rudolph, Pascal Hi...
AML
2006
106views more  AML 2006»
13 years 9 months ago
Upper bounds on complexity of Frege proofs with limited use of certain schemata
The paper considers a commonly used axiomatization of the classical propositional logic and studies how different axiom schemata in this system contribute to proof complexity of th...
Pavel Naumov
ISCAS
2007
IEEE
138views Hardware» more  ISCAS 2007»
14 years 3 months ago
Adaptive Pinning Synchronization of A General Complex Dynamical Network
— This paper further investigates and answers two fundamental questions in the complex dynamical networks: i) how many nodes should a general complex dynamical network with fixe...
Jin Zhou, Junan Lu, Jinhu Lu