Sciweavers

2498 search results - page 172 / 500
» Data Structures with Unpredictable Timing
Sort
View
ALGORITHMICA
2005
135views more  ALGORITHMICA 2005»
14 years 10 months ago
Queaps
A new priority queue structure, the queap, is introduced. The queap executes insertion in O(1) amortized time and extract-min in O(log(k+2)) amortized time if there are k items th...
John Iacono, Stefan Langerman
95
Voted
VLDB
1995
ACM
121views Database» more  VLDB 1995»
15 years 1 months ago
Benchmarking Spatial Join Operations with Spatial Output
The spatial join operation is benchmarked using variants of well-known spatial data structures such as the R-tree, R-tree, R+-tree, and the PMR quadtree. The focus is on a spatia...
Erik G. Hoel, Hanan Samet
103
Voted
DATESO
2009
158views Database» more  DATESO 2009»
14 years 8 months ago
Benchmarking Coding Algorithms for the R-tree Compression
Multi-dimensional data structures have been widely applied in many data management fields. Spatial data indexing is their natural application, however there are many applications i...
Jirí Walder, Michal Krátký, R...
TSP
2008
123views more  TSP 2008»
14 years 10 months ago
MIMO Radar Space-Time Adaptive Processing Using Prolate Spheroidal Wave Functions
In the traditional transmitting beamforming radar system, the transmitting antennas send coherent waveforms which form a highly focused beam. In the multiple-input multipleoutput (...
Chun-Yang Chen, Palghat P. Vaidyanathan
HIPC
2004
Springer
15 years 3 months ago
Lock-Free Parallel Algorithms: An Experimental Study
Abstract. Lock-free shared data structures in the setting of distributed computing have received a fair amount of attention. Major motivations of lock-free data structures include ...
Guojing Cong, David A. Bader