Sciweavers

4886 search results - page 170 / 978
» Approximate Data Exchange
Sort
View
PKDD
2000
Springer
134views Data Mining» more  PKDD 2000»
15 years 9 months ago
Induction of Multivariate Decision Trees by Using Dipolar Criteria
A new approach to the induction of multivariate decision trees is proposed. A linear decision function (hyper-plane) is used at each non-terminal node of a binary tree for splittin...
Leon Bobrowski, Marek Kretowski
NIPS
2008
15 years 7 months ago
The Mondrian Process
We describe a novel class of distributions, called Mondrian processes, which can be interpreted as probability distributions over kd-tree data structures. Mondrian processes are m...
Daniel M. Roy, Yee Whye Teh
ICIP
1999
IEEE
16 years 7 months ago
The Sinc-Approximating Kernels of Classical Polynomial Interpolation
A classical approach to interpolation of sampled data is polynomial interpolation. However, from the sampling theorem it follows that the ideal approach to interpolation is to con...
Erik H. W. Meijering, Wiro J. Niessen, Max A. Vier...
ICPR
2002
IEEE
16 years 7 months ago
A Windowed Weighted Approach for Approximate Cyclic String Matching
A method for measuring dissimilarities between cyclic strings is introduced. It computes a weighted mean between two (lower and upper) bounds of the exact cyclic edit distance, wh...
Ramón Alberto Mollineda, Enrique Vidal, Fra...
FORMATS
2007
Springer
16 years 13 days ago
Hypervolume Approximation in Timed Automata Model Checking
Dierence Bound Matrices (DBMs) are the most commonly used data structure for model checking timed automata. Since long they are being used in successful tools like Kronos or UPPAA...
Víctor A. Braberman, Jorge Lucángeli...