Sciweavers

93 search results - page 10 / 19
» Intrinsic Complexity of Uniform Learning
Sort
View
NIPS
2007
13 years 11 months ago
Learning with Tree-Averaged Densities and Distributions
We utilize the ensemble of trees framework, a tractable mixture over superexponential number of tree-structured distributions [1], to develop a new model for multivariate density ...
Sergey Kirshner
COCO
2005
Springer
99views Algorithms» more  COCO 2005»
14 years 3 months ago
On the Complexity of Succinct Zero-Sum Games
We study the complexity of solving succinct zero-sum games, i.e., the games whose payoff matrix M is given implicitly by a Boolean circuit C such that M(i, j) = C(i, j). We comple...
Lance Fortnow, Russell Impagliazzo, Valentine Kaba...
TKDE
1998
134views more  TKDE 1998»
13 years 9 months ago
Unified Data Model for Representing Multimedia, Timeline, and Simulation Data
—This paper describes a unified data model that represents multimedia, timeline, and simulation data utilizing a single set of related data modeling constructs. A uniform model f...
John D. N. Dionisio, Alfonso F. Cardenas
STOC
1994
ACM
128views Algorithms» more  STOC 1994»
14 years 1 months ago
Weakly learning DNF and characterizing statistical query learning using Fourier analysis
We present new results on the well-studied problem of learning DNF expressions. We prove that an algorithm due to Kushilevitz and Mansour [13] can be used to weakly learn DNF form...
Avrim Blum, Merrick L. Furst, Jeffrey C. Jackson, ...
MFCS
2004
Springer
14 years 3 months ago
Captive Cellular Automata
Abstract. We introduce a natural class of cellular automata characterised by a property of the local transition law without any assumption on the states set. We investigate some al...
Guillaume Theyssier