10608 search results - page 131 / 2122 » Complexity of O'Hara's Algorithm |
ALT
2005
Springer
14 years 7 months ago
2005
Springer
We bound the future loss when predicting any (computably) stochastic sequence online. Solomonoff finitely bounded the total deviation of his universal predictor M from the true ...
ISAAC
2005
Springer
14 years 3 months ago
2005
Springer
In this paper, we deal with both the complexity and the approximability of the labeled perfect matching problem in bipartite graphs. Given a simple graph G = (V, E) with n vertices...
ARITH
2003
IEEE
14 years 3 months ago
2003
IEEE
Multiplication of two numbers represented in base is shown to be computable by an on-line algorithm when is a negative integer, a positive non-integer real number, or a comp...
ESANN
2006
13 years 11 months ago
2006
Complex networks have received much attention in the last few years, and reveal global properties of interacting systems in domains like biology, social sciences and technology. O...
FOCS
1998
IEEE
14 years 2 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...