226 search results - page 3 / 46 » A Tutorial on Analog Computation: Computing Functions over t... |
CCA
2005
Springer
13 years 9 months ago
2005
Springer
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...
IJNSEC
2010
13 years 2 months ago
2010
Most public key crypto systems use finite field modulo arithmetic. This modulo arithmetic is applied on real numbers, binary values and polynomial functions. The computation cost ...
DATAMINE
1998
13 years 7 months ago
1998
The tutorial starts with an overview of the concepts of VC dimension and structural risk minimization. We then describe linear Support Vector Machines (SVMs) for separable and non-...
JUCS
2008
13 years 7 months ago
2008
: For any class F of total functions in the set N of the natural numbers, we define the notion of F-computable real number. A real number is called Fcomputable if there exist one-...
ICANN
1997
Springer
13 years 11 months ago
1997
Springer
Optical ow elds are a primary source of information about the visual scene in technical and biological systems. In a step towards a system for real time scene analysis we have deve...