Sciweavers

2962 search results - page 592 / 593
» Optimizing Spatial Data Structures For Static Data
Sort
View
SIGMETRICS
2008
ACM
181views Hardware» more  SIGMETRICS 2008»
13 years 7 months ago
Counter braids: a novel counter architecture for per-flow measurement
Fine-grained network measurement requires routers and switches to update large arrays of counters at very high link speed (e.g. 40 Gbps). A naive algorithm needs an infeasible amo...
Yi Lu, Andrea Montanari, Balaji Prabhakar, Sarang ...
MST
2002
128views more  MST 2002»
13 years 7 months ago
A Simple and Efficient Parallel Disk Mergesort
External sorting--the process of sorting a file that is too large to fit into the computer's internal memory and must be stored externally on disks--is a fundamental subroutin...
Rakesh D. Barve, Jeffrey Scott Vitter
DIS
2010
Springer
13 years 6 months ago
Discovery of Conservation Laws via Matrix Search
Abstract. One of the main goals of Discovery Science is the development and analysis of methods for automatic knowledge discovery in the natural sciences. A central area of natural...
Oliver Schulte, Mark S. Drew
EGH
2010
Springer
13 years 5 months ago
Parallel SAH k-D tree construction
The k-D tree is a well-studied acceleration data structure for ray tracing. It is used to organize primitives in a scene to allow efficient execution of intersection operations be...
Byn Choi, Rakesh Komuravelli, Victor Lu, Hyojin Su...
SSDBM
2010
IEEE
133views Database» more  SSDBM 2010»
13 years 5 months ago
PrefIndex: An Efficient Supergraph Containment Search Technique
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
Gaoping Zhu, Xuemin Lin, Wenjie Zhang, Wei Wang, H...