Sciweavers

481 search results - page 27 / 97
» Learning relational probability trees
Sort
View
COLT
2001
Springer
14 years 5 days ago
On Using Extended Statistical Queries to Avoid Membership Queries
The Kushilevitz-Mansour (KM) algorithm is an algorithm that finds all the “large” Fourier coefficients of a Boolean function. It is the main tool for learning decision trees ...
Nader H. Bshouty, Vitaly Feldman
VISAPP
2008
13 years 9 months ago
Continuous Learning of Simple Visual Concepts Using Incremental Kernel Density Estimation
In this paper we propose a method for continuous learning of simple visual concepts. The method continuously associates words describing observed scenes with automatically extracte...
Danijel Skocaj, Matej Kristan, Ales Leonardis
STOC
2006
ACM
129views Algorithms» more  STOC 2006»
14 years 8 months ago
Optimal phylogenetic reconstruction
One of the major tasks of evolutionary biology is the reconstruction of phylogenetic trees from molecular data. The evolutionary model is given by a Markov chain on the true evolu...
Constantinos Daskalakis, Elchanan Mossel, Sé...
ICML
2009
IEEE
14 years 8 months ago
Route kernels for trees
Almost all tree kernels proposed in the literature match substructures without taking into account their relative positioning with respect to one another. In this paper, we propos...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...
SODA
2008
ACM
97views Algorithms» more  SODA 2008»
13 years 9 months ago
Stochastic analyses for online combinatorial optimization problems
In this paper, we study online algorithms when the input is not chosen adversarially, but consists of draws from some given probability distribution. While this model has been stu...
Naveen Garg, Anupam Gupta, Stefano Leonardi, Piotr...