Sciweavers

1381 search results - page 253 / 277
» Structural signatures for tree data structures
Sort
View
CIKM
2000
Springer
15 years 4 months ago
Object and Query Transformation: Supporting Multi-Dimensional Queries through Code Reuse
The complexity of deploying high-performance spatial structures in transactional DBMS environments has motivated researchers to experiment with the idea of reusing the effort inve...
Ratko Orlandic, Byunggu Yu
NDSS
1999
IEEE
15 years 4 months ago
PGRIP: PNNI Global Routing Infrastructure Protection
We describe a system for achieving PNNI (Private Network-Network Interface) Global Routing Infrastructure Protection (PGRIP). We give details of PGRIP's system-level design a...
Sabrina De Capitani di Vimercati, Patrick Lincoln,...
STACS
1992
Springer
15 years 3 months ago
A Simplified Technique for Hidden-Line Elimination in Terrains
In this paper we give a practical and e cient output-sensitive algorithm for constructing the display of a polyhedral terrain. It runs in Od + nlog2 n time and uses On n space, wh...
Franco P. Preparata, Jeffrey Scott Vitter
CPM
2006
Springer
182views Combinatorics» more  CPM 2006»
15 years 3 months ago
Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
The Range-Minimum-Query-Problem is to preprocess an array such that the position of the minimum element between two specified indices can be obtained efficiently. We present a dire...
Johannes Fischer, Volker Heun
EDBT
2000
ACM
15 years 3 months ago
Mining Classification Rules from Datasets with Large Number of Many-Valued Attributes
Decision tree induction algorithms scale well to large datasets for their univariate and divide-and-conquer approach. However, they may fail in discovering effective knowledge when...
Giovanni Giuffrida, Wesley W. Chu, Dominique M. Ha...