Sciweavers

5595 search results - page 972 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
STOC
1994
ACM
128views Algorithms» more  STOC 1994»
15 years 10 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, ...
AI
1998
Springer
15 years 5 months ago
Methods for Task Allocation via Agent Coalition Formation
Task execution in multi-agent environments may require cooperation among agents. Given a set of agents and a set of tasks which they have to satisfy, we consider situations where ...
Onn Shehory, Sarit Kraus
ECCV
2002
Springer
16 years 8 months ago
Learning Shape from Defocus
We present a novel method for inferring three-dimensional shape from a collection of defocused images. It is based on the observation that defocused images are the null-space of ce...
Paolo Favaro, Stefano Soatto
RECOMB
2004
Springer
16 years 6 months ago
Modeling and Analysis of Heterogeneous Regulation in Biological Networks
Abstract. In this study we propose a novel model for the representation of biological networks and provide algorithms for learning model parameters from experimental data. Our appr...
Irit Gat-Viks, Amos Tanay, Ron Shamir
ATAL
2007
Springer
16 years 6 days ago
Letting loose a SPIDER on a network of POMDPs: generating quality guaranteed policies
Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are a popular approach for modeling multi-agent systems acting in uncertain domains. Given the signi...
Pradeep Varakantham, Janusz Marecki, Yuichi Yabu, ...