Sciweavers

255 search results - page 28 / 51
» Spanning Trees and Function Classes
Sort
View
SWAT
2004
Springer
153views Algorithms» more  SWAT 2004»
14 years 1 months ago
Melding Priority Queues
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup,...
TOMS
2010
106views more  TOMS 2010»
13 years 6 months ago
Computing Tutte Polynomials
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...
Gary Haggard, David J. Pearce, Gordon Royle
CVPR
2011
IEEE
13 years 4 months ago
Nonparametric Density Estimation on A Graph: Learning Framework, Fast Approximation and Application in Image Segmentation
We present a novel framework for tree-structure embedded density estimation and its fast approximation for mode seeking. The proposed method could find diverse applications in co...
Zhiding Yu, Oscar Au, Ketan Tang
ECML
2003
Springer
14 years 1 months ago
Logistic Model Trees
Abstract. Tree induction methods and linear models are popular techniques for supervised learning tasks, both for the prediction of nominal classes and continuous numeric values. F...
Niels Landwehr, Mark Hall, Eibe Frank
ICDE
2000
IEEE
130views Database» more  ICDE 2000»
14 years 9 months ago
CMP: A Fast Decision Tree Classifier Using Multivariate Predictions
Most decision tree classifiers are designed to keep class histograms for single attributes, and to select a particular attribute for the next split using said histograms. In this ...
Haixun Wang, Carlo Zaniolo