Sciweavers

1701 search results - page 47 / 341
» Computer Science and State Machines
Sort
View

Book
796views
16 years 8 months ago
Introduction to Machine Learning
This is an introductory book about machine learning. Notice that this is a draft book. It may contain typos, mistakes, etc. The book covers the following topics: Boolean Functio...
Nils J. Nilsson
TCS
2010
14 years 8 months ago
On the computational power of BlenX
We present some decidability and undecidability results for subsets of the BlenX Language, a process-calculi-based programming language developed for modelling biological processe...
Alessandro Romanel, Corrado Priami
CCA
2005
Springer
14 years 11 months ago
Computable Versions of Basic Theorems in Functional Analysis
If one wishes to find out whether a computational problem over discrete data is solvable or how complex it is, the classical approach is to represent the discrete objects in quest...
Atsushi Yoshikawa, Mariko Yasugi
ICALP
1992
Springer
15 years 1 months ago
Lower Bounds on the Complexity of Simplex Range Reporting on a Pointer Machine
Abstract Bernard Chazelle Department of Computer Science Princeton University Burton Rosenberg Department of Mathematics and Computer Science Dartmouth College We give a lower bou...
Bernard Chazelle, Burton Rosenberg
STOC
1998
ACM
112views Algorithms» more  STOC 1998»
15 years 2 months ago
Quantum Circuits with Mixed States
Current formal models for quantum computation deal only with unitary gates operating on “pure quantum states”. In these models it is difficult or impossible to deal formally w...
Dorit Aharonov, Alexei Kitaev, Noam Nisan