Sciweavers

100 search results - page 19 / 20
» Learning distance function by coding similarity
Sort
View
FOCS
2010
IEEE
13 years 3 months ago
A Fourier-Analytic Approach to Reed-Muller Decoding
Abstract. We present a Fourier-analytic approach to list-decoding Reed-Muller codes over arbitrary finite fields. We use this to show that quadratic forms over any field are locall...
Parikshit Gopalan
ML
2006
ACM
13 years 11 months ago
ML grid programming with ConCert
Grid computing has become increasingly popular with the growth of the Internet, especially in large-scale scientific computation. Computational Grids are characterized by their s...
Tom Murphy VII
BMCBI
2006
164views more  BMCBI 2006»
13 years 5 months ago
Evaluation of clustering algorithms for gene expression data
Background: Cluster analysis is an integral part of high dimensional data analysis. In the context of large scale gene expression data, a filtered set of genes are grouped togethe...
Susmita Datta, Somnath Datta
NIPS
2004
13 years 7 months ago
Maximising Sensitivity in a Spiking Network
We use unsupervised probabilistic machine learning ideas to try to explain the kinds of learning observed in real neurons, the goal being to connect abstract principles of self-or...
Anthony J. Bell, Lucas C. Parra
CAV
2007
Springer
121views Hardware» more  CAV 2007»
13 years 11 months ago
Algorithms for Interface Synthesis
Abstract. A temporal interface for a software component is a finite automaton that specifies the legal sequences of calls to functions that are provided by the component. We comp...
Dirk Beyer, Thomas A. Henzinger, Vasu Singh