Sciweavers

1284 search results - page 66 / 257
» Data Structures for Mergeable Trees
Sort
View
KDD
2003
ACM
150views Data Mining» more  KDD 2003»
14 years 8 months ago
Learning relational probability trees
Classification trees are widely used in the machine learning and data mining communities for modeling propositional data. Recent work has extended this basic paradigm to probabili...
Jennifer Neville, David Jensen, Lisa Friedland, Mi...
PKDD
2007
Springer
107views Data Mining» more  PKDD 2007»
14 years 1 months ago
An Empirical Comparison of Exact Nearest Neighbour Algorithms
Nearest neighbour search (NNS) is an old problem that is of practical importance in a number of fields. It involves finding, for a given point q, called the query, one or more po...
Ashraf M. Kibriya, Eibe Frank
ADBIS
2003
Springer
114views Database» more  ADBIS 2003»
14 years 24 days ago
Compressing Large Signature Trees
In this paper we present a new compression scheme for signature tree structures. Beyond the reduction of storage space, compression attains significant savings in terms of query pr...
Maria Kontaki, Yannis Manolopoulos, Alexandros Nan...
CGI
2003
IEEE
13 years 11 months ago
Reaching Volumes Generated by Means of Octal Trees and Cartesian Constraints
This paper presents a system to analyze the reachability of the human body. The inverse kinematics technique is employed to find which regions of space are reachable using a certa...
I. Rodríguez, Manuel Peinado, Ronan Boulic,...
CORR
2012
Springer
222views Education» more  CORR 2012»
12 years 3 months ago
A limit process for partial match queries in random quadtrees
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the d...
Nicolas Broutin, Ralph Neininger, Henning Sulzbach