Sciweavers

2479 search results - page 187 / 496
» Quantum complexity theory
Sort
View
MPC
2010
Springer
157views Mathematics» more  MPC 2010»
15 years 11 months ago
The Logic of Large Enough
Abstract. In this paper we explore the “for large enough” quantifier, also known as “all but finitely many”, which plays a central role in asymptotic reasoning, as used f...
Eerke A. Boiten, Dan Grundy
ALT
2010
Springer
15 years 8 months 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
COLING
1994
15 years 8 months ago
Towards a Proper Linguistic and Computational Treatment of Scrambling: An Analysis of Japanese
t This paper describes how recent linguistic results in explaining Japanese short and long distance scram hling (:an be directly incorporated into an existing principles-and-parame...
Sandiway Pong
184
Voted
BIOSYSTEMS
2008
111views more  BIOSYSTEMS 2008»
15 years 6 months ago
Autonomy and hypersets
This paper has two primary aims. The first is to provide an introductory discussion of hyperset theory and its usefulness for modeling complex systems. The second aim is a hyperset...
Anthony Chemero, Michael T. Turvey
CORR
2006
Springer
78views Education» more  CORR 2006»
15 years 6 months ago
What is the probability of connecting two points ?
The two-terminal reliability, known as the pair connectedness or connectivity function in percolation theory, may actually be expressed as a product of transfer matrices in which t...
Christian Tanguy