391 search results - page 63 / 79 » Structural and algorithmic issues of dynamic protocol update |
116
Voted
CIDR
2003
15 years 4 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...
139
Voted
IPTPS
2005
Springer
15 years 8 months ago
2005
Springer
— We propose here an analysis of a rich dataset which gives an exhaustive and dynamic view of the exchanges processed in a running eDonkey system. We focus on correlation in term...
172
click to vote
KDD
2007
ACM
16 years 3 months ago
2007
ACM
Existing data-stream clustering algorithms such as CluStream are based on k-means. These clustering algorithms are incompetent to find clusters of arbitrary shapes and cannot hand...
125
Voted
IEAAIE
2009
Springer
15 years 9 months ago
2009
Springer
The process of knowledge discovery from databases is a knowledge intensive, highly user-oriented practice, thus has recently heralded the development of ontology-incorporated data ...
103
Voted
VLDB
1998
ACM
15 years 7 months ago
1998
ACM
The problem of finding an optimal bipartition of a rectangle set has a direct impact on query performance of dynamic R-trees. During update operations, overflowed nodes need to be...