99 search results - page 6 / 20 » Single-Pass List Partitioning |
90
Voted
CIDR
2003
15 years 1 months ago
2003
Partitioning within a B-tree, based on an artificial leading key column and combined with online reorganization, can be exploited during external merge sort for accurate deep read...
COMBINATORICS
2006
14 years 11 months ago
2006
With a graph G = (V, E) we associate a collection of non-negative real weights vV {i,v : 1 i m} uvE{ij,uv : 1 i j m}. We consider the probability distribution on {f : V {1,...
124
click to vote
PODC
2010
ACM
15 years 3 months ago
2010
ACM
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...
81
Voted
SC
1995
ACM
15 years 3 months ago
1995
ACM
Recently, a number of researchers have investigated a class of algorithms that are based on multilevel graph partitioning that have moderate computational complexity, and provide ...
KDD
2005
ACM
15 years 5 months ago
2005
ACM
Data clustering represents an important tool in exploratory data analysis. The lack of objective criteria render model selection as well as the identification of robust solutions...