16430 search results - page 832 / 3286 » On Computable Tree Functions |
155
click to vote
CGF
2000
15 years 7 months ago
2000
We present a method for computer generated pen-and-ink illustrations by the simulation of stippling. In a stipple drawing, dots are used to represent tone and also material of sur...
188
click to vote
CORR
2000
Springer
15 years 7 months ago
2000
Springer
A polynomial depth quantum circuit affects, by definition, a poly-local unitary transformation of a tensor product state space. It is a reasonable belief [Fe], [L], [FKW] that, at ...
232
click to vote
SAGT
2010
Springer
15 years 6 months ago
2010
Springer
We study the computational complexity of finding stable outcomes in symmetric additively-separable hedonic games. These coalition formation games are specified by an undirected e...
204
click to vote
FSTTCS
2010
Springer
15 years 5 months ago
2010
Springer
This paper describes a project that aims at showing that propositional proofs of certain tautologies in weak proof system give upper bounds on the computational complexity of func...
178
click to vote
DRR
2009
15 years 5 months ago
2009
We are interested in the problem of curve identification, motivated by problems in handwriting recognition. Various geometric approaches have been proposed, with one of the most p...