1068 search results - page 159 / 214 » Extremely randomized trees |
119
click to vote
JNS
2010
15 years 3 months ago
2010
This paper introduces a new method to show the validity of a continuum description for the deterministic dynamics of many interacting particles. Here the many particle evolution is...
137
Voted
TOMS
2010
15 years 3 months ago
2010
The Tutte polynomial of a graph, also known as the partition function of the q-state Potts model, is a 2-variable polynomial graph invariant of considerable importance in both comb...
137
click to vote
FOCS
2009
IEEE
15 years 2 months ago
2009
IEEE
We give a new model of learning motivated by smoothed analysis (Spielman and Teng, 2001). In this model, we analyze two new algorithms, for PAC-learning DNFs and agnostically learn...
160
click to vote
CVPR
2008
IEEE
16 years 7 months ago
2008
IEEE
We propose semantic texton forests, efficient and powerful new low-level features. These are ensembles of decision trees that act directly on image pixels, and therefore do not ne...
165
click to vote
WWW
2008
ACM
16 years 5 months ago
2008
ACM
Efficiently querying RDF [1] data is being an important factor in applying Semantic Web technologies to real-world applications. In this context, many efforts have been made to st...