Sciweavers

507 search results - page 64 / 102
» Generating Better Decision Trees
Sort
View
DCC
2001
IEEE
14 years 9 months ago
Towards Compressing Web Graphs
We consider the problem of compressing graphs of the link structure of the World Wide Web. We provide efficient algorithms for such compression that are motivated by recently prop...
Micah Adler, Michael Mitzenmacher
WACV
2008
IEEE
14 years 4 months ago
Background Subtraction for Temporally Irregular Dynamic Textures
In the traditional mixture of Gaussians background model, the generating process of each pixel is modeled as a mixture of Gaussians over color. Unfortunately, this model performs ...
Gerald Dalley, Joshua Migdal, W. Eric L. Grimson
MLDM
2005
Springer
14 years 3 months ago
Multivariate Discretization by Recursive Supervised Bipartition of Graph
Abstract. In supervised learning, discretization of the continuous explanatory attributes enhances the accuracy of decision tree induction algorithms and naive Bayes classifier. M...
Sylvain Ferrandiz, Marc Boullé
NIPS
1996
13 years 11 months ago
Predicting Lifetimes in Dynamically Allocated Memory
Predictions oflifetimesofdynamicallyallocated objects can be used to improve time and space e ciency of dynamic memory management in computer programs. Barrett and Zorn 1993] used...
David A. Cohn, Satinder P. Singh
IJIT
2004
13 years 11 months ago
Computing Entropy for Ortholog Detection
Abstract-- Biological sequences from different species are called orthologs if they evolved from a sequence of a common ancestor species and they have the same biological function....
Hsing-Kuo Pao, John Case