Sciweavers

61 search results - page 6 / 13
» tcs 2002
Sort
View
TCS
2002
14 years 9 months ago
Augmenting the discrete timed automaton with other data structures
We describe a general automata-theoretic approach for analyzing the veri
Oscar H. Ibarra, Jianwen Su
TCS
2002
14 years 9 months ago
Unsupervised learning in neural computation
In this article, we consider unsupervised learning from the point of view of applying neural computation on signal and data analysis problems. The article is an introductory surve...
Erkki Oja
TCS
2002
14 years 9 months ago
Complexity measures and decision tree complexity: a survey
We discuss several complexity measures for Boolean functions: certi cate complexity, sensitivity, block sensitivity, and the degree of a representing or approximating polynomial. ...
Harry Buhrman, Ronald de Wolf
TCS
2002
14 years 9 months ago
Streams and strings in formal proofs
Streams are acyclic directed subgraphs of the logical ow graph of a proof representing bundles of paths with the same origin and the same end. The notion of stream is used to desc...
Alessandra Carbone
TCS
2002
14 years 9 months ago
An example of a computable absolutely normal number
The first example of an absolutely normal number was given by Sierpinski in 1916, twenty years before the concept of computability was formalized. In this note we give a recursive...
Verónica Becher, Santiago Figueira