Sciweavers

1578 search results - page 85 / 316
» Algorithmic randomness of continuous functions
Sort
View
ALT
2001
Springer
15 years 6 months ago
Learning of Boolean Functions Using Support Vector Machines
This paper concerns the design of a Support Vector Machine (SVM) appropriate for the learning of Boolean functions. This is motivated by the need of a more sophisticated algorithm ...
Ken Sadohara
ESA
2009
Springer
90views Algorithms» more  ESA 2009»
15 years 4 months ago
Storing a Compressed Function with Constant Time Access
We consider the problem of representing, in a space-efficient way, a function f : S → Σ such that any function value can be computed in constant time on a RAM. Specifically, ou...
Jóhannes B. Hreinsson, Morten Krøyer...
SAS
2004
Springer
140views Formal Methods» more  SAS 2004»
15 years 3 months ago
Path-Sensitive Analysis for Linear Arithmetic and Uninterpreted Functions
We describe data structures and algorithms for performing a path-sensitive program analysis to discover equivalences of expressions involving linear arithmetic or uninterpreted fun...
Sumit Gulwani, George C. Necula
ISCAS
2003
IEEE
114views Hardware» more  ISCAS 2003»
15 years 3 months ago
On the hardware implementations of the SHA-2 (256, 384, 512) hash functions
Couple to the communications wired and unwired networks growth, is the increasing demand for strong secure data transmission. New cryptographic standards are developed, and new en...
Nicolas Sklavos, Odysseas G. Koufopavlou
ANNPR
2006
Springer
15 years 1 months ago
Simple and Effective Connectionist Nonparametric Estimation of Probability Density Functions
Abstract. Estimation of probability density functions (pdf) is one major topic in pattern recognition. Parametric techniques rely on an arbitrary assumption on the form of the unde...
Edmondo Trentin