Sciweavers

2104 search results - page 5 / 421
» Sorting with networks of data structures
Sort
View
CIDR
2003
147views Algorithms» more  CIDR 2003»
13 years 8 months ago
Sorting And Indexing With Partitioned B-Trees
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...
Goetz Graefe
ISAAC
2009
Springer
132views Algorithms» more  ISAAC 2009»
14 years 1 months ago
Online Sorted Range Reporting
Abstract. We study the following one-dimensional range reporting problem: On an array A of n elements, support queries that given two indices i ≤ j and an integer k report the k ...
Gerth Stølting Brodal, Rolf Fagerberg, Mark...
UIST
2006
ACM
14 years 1 months ago
Enabling web browsers to augment web sites' filtering and sorting functionalities
Existing augmentations of web pages are mostly small cosmetic changes (e.g., removing ads) and minor addition of third-party content (e.g., product prices from competing sites). N...
David F. Huynh, Robert C. Miller, David R. Karger
JCIT
2010
184views more  JCIT 2010»
13 years 2 months ago
A Cell Projection Algorithm Based on Feature Region Segmentation and Cells Sorting
Because of the complexity of the human structure, and the irregularity of the human tissues, and the discrepancy of human individuality, segmenting and rendering 3D medical data f...
Li Xinwu
ESOA
2006
13 years 11 months ago
Dynamic Decentralized Any-Time Hierarchical Clustering
Hierarchical clustering is used widely to organize data and search for patterns. Previous algorithms assume that the body of data being clustered is fixed while the algorithm runs...
H. Van Dyke Parunak, Richard Rohwer, Theodore C. B...