Sciweavers

204 search results - page 10 / 41
» Fast Set Operations Using Treaps
Sort
View
EDBT
2006
ACM
255views Database» more  EDBT 2006»
15 years 11 months ago
FIS-by-Step: Visualization of the Fast Index Scan for Nearest Neighbor Queries
Abstract. Many different index structures have been proposed for spatial databases to support efficient query processing. However, most of these index structures suffer from an exp...
Elke Achtert, Dominik Schwald
FAST
2009
14 years 9 months ago
A Framework for Fine-grained Data Integration and Curation, with Provenance, in a Dataspace
Some tasks in a dataspace (a loose collection of heterogeneous data sources) require integration of fine-grained data from diverse sources. This work is often done by end users kn...
David W. Archer, Lois M. L. Delcambre, David Maier
DAC
2005
ACM
15 years 1 months ago
Performance simulation modeling for fast evaluation of pipelined scalar processor by evaluation reuse
This paper proposes a rapid and accurate evaluation scheme for cycle counts of a pipelined processor using evaluation reuse technique. Since exploration of an optimal processor is...
Ho Young Kim, Tag Gon Kim
VLSISP
2008
173views more  VLSISP 2008»
14 years 11 months ago
Fast Bit Gather, Bit Scatter and Bit Permutation Instructions for Commodity Microprocessors
Advanced bit manipulation operations are not efficiently supported by commodity word-oriented microprocessors. Programming tricks are typically devised to shorten the long sequence...
Yedidya Hilewitz, Ruby B. Lee
OSDI
2004
ACM
15 years 12 months ago
FFPF: Fairly Fast Packet Filters
FFPF is a network monitoring framework designed for three things: speed (handling high link rates), scalability (ability to handle multiple applications) and flexibility. Multiple...
Herbert Bos, Willem de Bruijn, Mihai-Lucian Criste...