Sciweavers

1845 search results - page 271 / 369
» Machine-Learning Applications of Algorithmic Randomness
Sort
View
APPROX
2005
Springer
84views Algorithms» more  APPROX 2005»
14 years 1 months ago
The Tensor Product of Two Codes Is Not Necessarily Robustly Testable
There has been significant interest lately in the task of constructing codes that are testable with a small number of random probes. Ben-Sasson and Sudan show that the repeated te...
Paul Valiant
SACRYPT
2004
Springer
113views Cryptology» more  SACRYPT 2004»
14 years 1 months ago
A Note on the Signed Sliding Window Integer Recoding and a Left-to-Right Analogue
Addition-subtraction-chains obtained from signed digit recodings of integers are a common tool for computing multiples of random elements of a group where the computation of invers...
Roberto Maria Avanzi
SCVMA
2004
Springer
14 years 1 months ago
Motion Detection Using Wavelet Analysis and Hierarchical Markov Models
This paper deals with the motion detection problem. This issue is of key importance in many application fields. To solve this problem, we compute the dominant motion in the sequen...
Cédric Demonceaux, Djemâa Kachi-Akkou...
ICCBR
2003
Springer
14 years 1 months ago
Soft Interchangeability for Case Adaptation
In [1] we propose interchangeability based algorithms as methods for solving the case adaptation for the domain of problems which can be expressed as Constraint Satisfaction Proble...
Nicoleta Neagu, Boi Faltings
IJCNN
2000
IEEE
14 years 17 days ago
Metrics that Learn Relevance
We introduce an algorithm for learning a local metric to a continuous input space that measures distances in terms of relevance to the processing task. The relevance is defined a...
Samuel Kaski, Janne Sinkkonen