Sciweavers

498 search results - page 88 / 100
» Experimental comparison of the two Fredman-Khachiyan-algorit...
Sort
View
SAC
2005
ACM
15 years 3 months ago
Learning decision trees from dynamic data streams
: This paper presents a system for induction of forest of functional trees from data streams able to detect concept drift. The Ultra Fast Forest of Trees (UFFT) is an incremental a...
João Gama, Pedro Medas, Pedro Pereira Rodri...
KDD
2005
ACM
177views Data Mining» more  KDD 2005»
15 years 3 months ago
Combining partitions by probabilistic label aggregation
Data clustering represents an important tool in exploratory data analysis. The lack of objective criteria render model selection as well as the identification of robust solutions...
Tilman Lange, Joachim M. Buhmann
OOPSLA
2005
Springer
15 years 3 months ago
Quantifying the performance of garbage collection vs. explicit memory management
Garbage collection yields numerous software engineering benefits, but its quantitative impact on performance remains elusive. One can compare the cost of conservative garbage col...
Matthew Hertz, Emery D. Berger
SCIA
2005
Springer
186views Image Analysis» more  SCIA 2005»
15 years 3 months ago
Levelset and B-Spline Deformable Model Techniques for Image Segmentation: A Pragmatic Comparative Study
Deformable contours are now widely used in image segmentation, using different models, criteria and numeric schemes. Some theoretical comparisons between few deformable model met...
Diane Lingrand, Johan Montagnat
PLDI
2004
ACM
15 years 3 months ago
Parametric regular path queries
Regular path queries are a way of declaratively expressing queries on graphs as regular-expression-like patterns that are matched against paths in the graph. There are two kinds o...
Yanhong A. Liu, Tom Rothamel, Fuxiang Yu, Scott D....