Sciweavers

61 search results - page 9 / 13
» ipl 2007
Sort
View
IPL
2007
80views more  IPL 2007»
14 years 9 months ago
Execution time analysis of a top-down R-tree construction algorithm
A detailed CPU execution-time analysis and implementation are given for a bulk loading algorithm to construct R-trees due to García et al. [Y.J. García, M.A. López, S.T. Leuten...
Houman Alborzi, Hanan Samet
IPL
2007
81views more  IPL 2007»
14 years 9 months ago
Linear-time algorithms for problems on planar graphs with fixed disk dimension
The disk dimension of a planar graph G is the least number k for which G embeds in the plane minus k open disks, with every vertex on the boundary of some disk. Useful properties ...
Faisal N. Abu-Khzam, Michael A. Langston
IPL
2007
111views more  IPL 2007»
14 years 9 months ago
Scalable Bloom Filters
Bloom Filters provide space-efficient storage of sets at the cost of a probability of false positives on membership queries. The size of the filter must be defined a priori bas...
Paulo Sérgio Almeida, Carlos Baquero, Nuno ...
IPL
2007
79views more  IPL 2007»
14 years 9 months ago
Uniform metrical task systems with a limited number of states
We give a randomized algorithm (the ”Wedge Algorithm”) of competitiveness 3 2 Hk − 1 2k for any metrical task system on a uniform space of k points, for any k ≥ 2, where H...
Wolfgang W. Bein, Lawrence L. Larmore, John Noga
IPL
2007
71views more  IPL 2007»
14 years 9 months ago
Fault-tolerant analysis of a class of networks
In this paper, we explore the 2-extraconnectivity of a special class of graphs G(G0,G1;M) proposed by Chen et al. [Y.-C. Chen, J.J.M. Tan, L.-H. Hsu, S.-S. Kao, Super-connectivity...
Jun-Ming Xu, Qiang Zhu 0003, Min Xu