Sciweavers

11212 search results - page 477 / 2243
» Semi-persistent Data Structures
Sort
View
ESA
2010
Springer
140views Algorithms» more  ESA 2010»
15 years 8 months ago
A Unified Approach to Approximate Proximity Searching
The inability to answer proximity queries efficiently for spaces of dimension d > 2 has led to the study of approximation to proximity problems. Several techniques have been pro...
Sunil Arya, Guilherme Dias da Fonseca, David M. Mo...
HPCC
2010
Springer
15 years 8 months ago
Insertion Tree Phasers: Efficient and Scalable Barrier Synchronization for Fine-Grained Parallelism
This paper presents an algorithm and a data structure for scalable dynamic synchronization in fine-grained parallelism. The algorithm supports the full generality of phasers with d...
Stefan Marr, Stijn Verhaegen, Bruno De Fraine, The...
GLOBECOM
2008
IEEE
15 years 7 months ago
Highly Memory-Efficient LogLog Hash for Deep Packet Inspection
As the network line rates reach 40 Gbps today and 100 Gbps in the near future, performing deep packet inspection (DPI) in the Network Intrusion Detection and Prevention Systems (NI...
Masanori Bando, N. Sertac Artan, H. Jonathan Chao
CVIU
2008
79views more  CVIU 2008»
15 years 7 months ago
Registration of combined range-intensity scans: Initialization through verification
This paper presents an automatic registration system for aligning combined range
Eric R. Smith, Bradford J. King, Charles V. Stewar...
ENTCS
2008
120views more  ENTCS 2008»
15 years 7 months ago
Reasoning about B+ Trees with Operational Semantics and Separation Logic
The B+ tree is an ordered tree structure with a fringe list. It is the most widely used data structure for data organisation and searching in database systems specifically, and, p...
Alan P. Sexton, Hayo Thielecke