Sciweavers

1068 search results - page 143 / 214
» Extremely randomized trees
Sort
View
ICCV
2011
IEEE
12 years 11 months ago
Discriminative Learning of Relaxed Hierarchy for Large-scale Visual Recognition
In the real visual world, the number of categories a classifier needs to discriminate is on the order of hundreds or thousands. For example, the SUN dataset [24] contains 899 sce...
Tianshi Gao, Daphne Koller
KER
2007
90views more  KER 2007»
13 years 11 months ago
PLTOOL: A knowledge engineering tool for planning and learning
AI planning solves the problem of generating a correct and efficient ordered set of instantiated activities, from a knowledge base of generic actions, which when executed will tra...
Susana Fernández, Daniel Borrajo, Raquel Fu...
JCSS
2008
120views more  JCSS 2008»
13 years 11 months ago
Quantum certificate complexity
Given a Boolean function f, we study two natural generalizations of the certificate complexity C (f): the randomized certificate complexity RC (f) and the quantum certificate comp...
Scott Aaronson
STOC
2009
ACM
171views Algorithms» more  STOC 2009»
14 years 11 months ago
On the geometry of graphs with a forbidden minor
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...
James R. Lee, Anastasios Sidiropoulos
ICDM
2009
IEEE
124views Data Mining» more  ICDM 2009»
14 years 5 months ago
Rule Ensembles for Multi-target Regression
—Methods for learning decision rules are being successfully applied to many problem domains, especially where understanding and interpretation of the learned model is necessary. ...
Timo Aho, Bernard Zenko, Saso Dzeroski