103 search results - page 10 / 21 » The Arithmetical Complexity of Dimension and Randomness |
CLEF
2010
Springer
13 years 8 months ago
2010
Springer
Image classification or annotation is proved difficult for the computer algorithms. The Naive-Bayes Nearest Neighbor method is proposed to tackle the problem, and achieved the stat...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
In this paper, we study phase transition behavior emerging from the interactions among multiple agents in the presence of noise. We propose a simple discrete-time model in which a...
CSL
2010
Springer
13 years 9 months ago
2010
Springer
By a Euclidean logic, we understand a formal language whose variables range over subsets of Euclidean space, of some fixed dimension, and whose non-logical primitives have fixed me...
ALT
2006
Springer
14 years 5 months ago
2006
Springer
Abstract. This paper introduces a framework for quantum exact learning via queries, the so-called quantum protocol. It is shown that usual protocols in the classical learning setti...
MP
2008
13 years 8 months ago
2008
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...