Sciweavers

1248 search results - page 65 / 250
» On the Number of Birch Partitions
Sort
View
DAWAK
2005
Springer
14 years 2 months ago
Nearest Neighbor Search on Vertically Partitioned High-Dimensional Data
Abstract. In this paper, we present a new approach to indexing multidimensional data that is particularly suitable for the efficient incremental processing of nearest neighbor quer...
Evangelos Dellis, Bernhard Seeger, Akrivi Vlachou
FSTTCS
2004
Springer
14 years 2 months ago
Approximate Range Searching Using Binary Space Partitions
We show how any BSP tree TP for the endpoints of a set of n disjoint segments in the plane can be used to obtain a BSP tree of size O(n · depth(TP )) for the segments themselves, ...
Mark de Berg, Micha Streppel
KDD
1995
ACM
148views Data Mining» more  KDD 1995»
14 years 8 days ago
Learning Arbiter and Combiner Trees from Partitioned Data for Scaling Machine Learning
Knowledge discovery in databases has become an increasingly important research topic with the advent of wide area network computing. One of the crucial problems we study in this p...
Philip K. Chan, Salvatore J. Stolfo
ALGORITHMICA
2002
93views more  ALGORITHMICA 2002»
13 years 8 months ago
Improved Algorithms for Uniform Partitions of Points
We consider the following one- and two-dimensional bucketing problems: Given a set S of n points in R1 or R2 and a positive integer b, distribute the points of S into b equal-size ...
Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep ...
JCO
2002
77views more  JCO 2002»
13 years 8 months ago
Traffic Partition in WDM/SONET Rings to Minimize SONET ADMs
SONET(SynchronousOpticalNETworks)add-dropmultiplexers(ADMs)arethedominantcostfactor in the WDM(Wavelength Division Multiplexing)/SONET rings. The number of SONET ADMs required by a...
Gruia Calinescu, Peng-Jun Wan