Sciweavers

44 search results - page 7 / 9
» On Optimal Node Splitting for R-trees
Sort
View
ICDCS
2009
IEEE
15 years 7 months ago
m-LIGHT: Indexing Multi-Dimensional Data over DHTs
In this paper, we study the problem of indexing multidimensional data in the P2P networks based on distributed hash tables (DHTs). We identify several design issues and propose a ...
Yuzhe Tang, Jianliang Xu, Shuigeng Zhou, Wang-Chie...
ALENEX
2001
215views Algorithms» more  ALENEX 2001»
14 years 11 months ago
An Empirical Study of a New Approach to Nearest Neighbor Searching
In nearest neighbor searching we are given a set of n data points in real d-dimensional space, d , and the problem is to preprocess these points into a data structure, so that give...
Songrit Maneewongvatana, David M. Mount
JDWM
2007
107views more  JDWM 2007»
14 years 10 months ago
Evolutionary Induction of Mixed Decision Trees
This article presents a new evolutionary algorithm (EA) for induction of mixed decision trees. In nonterminal nodes of a mixed tree, different types of tests can be placed, rangin...
Marek Kretowski, Marek Grzes
CCGRID
2010
IEEE
14 years 11 months ago
An MPI-Stream Hybrid Programming Model for Computational Clusters
The MPI programming model hides network type and topology from developers, but also allows them to seamlessly distribute a computational job across multiple cores in both an intra ...
Emilio Pasquale Mancini, Gregory Marsh, Dhabaleswa...
SIGMOD
1996
ACM
133views Database» more  SIGMOD 1996»
15 years 2 months ago
Multi-dimensional Resource Scheduling for Parallel Queries
Scheduling query execution plans is an important component of query optimization in parallel database systems. The problem is particularly complex in a shared-nothing execution en...
Minos N. Garofalakis, Yannis E. Ioannidis