Sciweavers

1060 search results - page 133 / 212
» On the Discovery of Random Trees
Sort
View
COMPGEOM
2010
ACM
15 years 11 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park
RECOMB
2002
Springer
16 years 6 months ago
Discovering local structure in gene expression data: the order-preserving submatrix problem
This paper concerns the discovery of patterns in gene expression matrices, in which each element gives the expression level of a given gene in a given experiment. Most existing me...
Amir Ben-Dor, Benny Chor, Richard M. Karp, Zohar Y...
INFOVIS
1999
IEEE
15 years 10 months ago
Sensemaking of Evolving Web Sites Using Visualization Spreadsheets
In the process of knowledge discovery, workers examine available information in order to make sense of it. By sensemaking, we mean interacting with and operating on the informatio...
Ed Huai-hsin Chi, Stuart K. Card
MCS
2007
Springer
16 years 13 days ago
An Experimental Study on Rotation Forest Ensembles
Rotation Forest is a recently proposed method for building classifier ensembles using independently trained decision trees. It was found to be more accurate than bagging, AdaBoost...
Ludmila I. Kuncheva, Juan José Rodrí...
DAGM
2010
Springer
15 years 7 months ago
On-Line Multi-view Forests for Tracking
Abstract. A successful approach to tracking is to on-line learn discriminative classifiers for the target objects. Although these trackingby-detection approaches are usually fast a...
Christian Leistner, Martin Godec, Amir Saffari, Ho...