14699 search results - page 341 / 2940 » Complexity and Cognitive Computing |
147
click to vote
MLG
2007
Springer
15 years 10 months ago
2007
Springer
Recent investigations [12, 2, 8, 5, 6] and [11, 9] indicate the use of a probabilistic (’learning’) perspective of tasks defined on a single graph, as opposed to the traditio...
142
click to vote
LATIN
1998
Springer
15 years 8 months ago
1998
Springer
The reconstruction of a shape or surface from a finite set of points is a practically significant and theoretically challenging problem. This paper presents a unified view of algor...
172
Voted
FSTTCS
1992
Springer
15 years 8 months ago
1992
Springer
Levin introduced an average-case complexity measure, based on a notion of \polynomialon average," and de ned \average-case polynomial-time many-one reducibility" amongra...
145
Voted
LATIN
2010
Springer
15 years 6 months ago
2010
Springer
We study the worst case complexity of regular operations on cofinite languages (i.e., languages whose complement is finite) and provide algorithms to compute efficiently the result...
129
click to vote
ALT
2005
Springer
16 years 1 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 ...