Sciweavers

4536 search results - page 59 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
SODA
2004
ACM
82views Algorithms» more  SODA 2004»
13 years 10 months ago
Dynamizing static algorithms, with applications to dynamic trees and history independence
We describe a machine model for automatically dynamizing static algorithms and apply it to historyindependent data structures. Static programs expressed in this model are dynamize...
Umut A. Acar, Guy E. Blelloch, Robert Harper, Jorg...
CORR
2008
Springer
86views Education» more  CORR 2008»
13 years 9 months ago
Efficient Algorithmic Techniques for Several Multidimensional Geometric Data Management and Analysis Problems
: In this paper I present several novel, efficient, algorithmic techniques for solving some multidimensional geometric data management and analysis problems. The techniques are bas...
Mugurel Ionut Andreica
PVLDB
2008
90views more  PVLDB 2008»
13 years 8 months ago
Sorting hierarchical data in external memory for archiving
Sorting hierarchical data in external memory is necessary for a wide variety of applications including archiving scientific data and dealing with large XML datasets. The topic of ...
Ioannis Koltsidas, Heiko Müller, Stratis Vigl...
ESOP
2008
Springer
13 years 10 months ago
Semi-persistent Data Structures
A data structure is said to be persistent when any update operation returns a new structure without altering the old version. This paper introduces a new notion of persistence, cal...
Sylvain Conchon, Jean-Christophe Filliâtre

Book
412views
15 years 8 months ago
Algorithms for Clustering Data
"Cluster analysis is an important technique in the rapidly growing field known as exploratory data analysis and is being applied in a variety of engineering and scientific dis...
A. K. Jain, R. C. Dubes