Sciweavers

1806 search results - page 254 / 362
» Some Functions Computable with a Fused-Mac
Sort
View
STOC
2000
ACM
174views Algorithms» more  STOC 2000»
15 years 10 months ago
Noise-tolerant learning, the parity problem, and the statistical query model
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
Avrim Blum, Adam Kalai, Hal Wasserman
COLT
1999
Springer
15 years 10 months ago
Regret Bounds for Prediction Problems
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
Geoffrey J. Gordon

Book
246views
17 years 3 months ago
Using, Understanding, and Unraveling The OCaml Language
"These course notes are addressed to a wide audience of people interested in modern programming languages in general, ML-like languages in particular, or simply in OCaml, whet...
Didier Remy

Book
2028views
17 years 1 months ago
TCL Wise - Guide to the TCL Programming Language
"this book is an introduction to the main ideas of the Tcl programming language: If you wish to learn a simple and powerful programming language, this book is for you. To read...
Salvatore Sanfilippo
151
Voted
DAC
1999
ACM
16 years 6 months ago
Graph Coloring Algorithms for Fast Evaluation of Curtis Decompositions
Finding the minimum column multiplicity for a bound set of variables is an important problem in Curtis decomposition. To investigate this problem, we compared two graphcoloring pr...
Marek A. Perkowski, Rahul Malvi, Stan Grygiel, Mic...