Sciweavers

25 search results - page 3 / 5
» Optimal Average Case Sorting on Arrays
Sort
View
JEA
2008
120views more  JEA 2008»
13 years 8 months ago
Better external memory suffix array construction
Suffix arrays are a simple and powerful data structure for text processing that can be used for full text indexes, data compression, and many other applications in particular in b...
Roman Dementiev, Juha Kärkkäinen, Jens M...
MASCOTS
2001
13 years 10 months ago
A Modular, Analytical Throughput Model for Modern Disk Arrays
Enterprise storage systems depend on disk arrays for their capacity and availability needs. To design and maintain storage systems that efficiently satisfy evolving requirements, ...
Mustafa Uysal, Guillermo A. Alvarez, Arif Merchant
PODS
2001
ACM
127views Database» more  PODS 2001»
14 years 8 months ago
Optimal Aggregation Algorithms for Middleware
Assume that each object in a database has m grades, or scores, one for each of m attributes. For example, an object can have a color grade, that tells how red it is, and a shape g...
Ronald Fagin, Amnon Lotem, Moni Naor
FAW
2010
Springer
259views Algorithms» more  FAW 2010»
13 years 9 months ago
Adaptive Algorithms for Planar Convex Hull Problems
We study problems in computational geometry from the viewpoint of adaptive algorithms. Adaptive algorithms have been extensively studied for the sorting problem, and in this paper ...
Hee-Kap Ahn, Yoshio Okamoto
CORR
2008
Springer
103views Education» more  CORR 2008»
13 years 8 months ago
Quickest Change Detection of a Markov Process Across a Sensor Array
Recent attention in quickest change detection in the multi-sensor setting has been on the case where the densities of the observations change at the same instant at all the sensor...
Vasanthan Raghavan, Venugopal V. Veeravalli