Sciweavers

39 search results - page 8 / 8
» Equivalent Conditions for Regularity (Extended Abstract)
Sort
View
COLT
2007
Springer
13 years 12 months ago
Learning Large-Alphabet and Analog Circuits with Value Injection Queries
Abstract. We consider the problem of learning an acyclic discrete circuit with n wires, fan-in bounded by k and alphabet size s using value injection queries. For the class of tran...
Dana Angluin, James Aspnes, Jiang Chen, Lev Reyzin
CP
2000
Springer
13 years 10 months ago
Automatic Generation of Propagation Rules for Finite Domains
plexity Theorems: Talk Abstract . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 David McAllester Regular Papers Automatic Generation of Propagation Rules for F...
Slim Abdennadher, Christophe Rigotti
STOC
2005
ACM
96views Algorithms» more  STOC 2005»
14 years 6 months ago
Every monotone graph property is testable
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many ...
Noga Alon, Asaf Shapira
TIT
1998
96views more  TIT 1998»
13 years 5 months ago
Sequential Prediction of Individual Sequences Under General Loss Functions
Abstract— We consider adaptive sequential prediction of arbitrary binary sequences when the performance is evaluated using a general loss function. The goal is to predict on each...
David Haussler, Jyrki Kivinen, Manfred K. Warmuth