2233 search results - page 142 / 447 » On the Complexity of Theory Curbing |
169
click to vote
COMPGEOM
2004
ACM
15 years 12 months ago
2004
ACM
We prove that the geometric thickness of graphs whose maximum degree is no more than four is two. In our proofs, we present a space and time efficient embedding technique for gra...
155
click to vote
MFCS
2004
Springer
15 years 11 months ago
2004
Springer
In learning theory and genetic programming, OBDDs are used to represent approximations of Boolean functions. This motivates the investigation of the OBDD complexity of approximatin...
164
click to vote
MPC
2010
Springer
15 years 11 months ago
2010
Springer
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...
143
click to vote
ALT
2010
Springer
15 years 8 months ago
2010
Springer
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...
137
click to vote
COLING
1994
15 years 7 months ago
1994
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...