Sciweavers

2297 search results - page 155 / 460
» A fast APRIORI implementation
Sort
View
CLUSTER
2005
IEEE
15 years 4 months ago
Fast Query Processing by Distributing an Index over CPU Caches
Data intensive applications on clusters often require requests quickly be sent to the node managing the desired data. In many applications, one must look through a sorted tree str...
Xiaoqin Ma, Gene Cooperman
IPPS
2005
IEEE
15 years 4 months ago
Fast Address Translation Techniques for Distributed Shared Memory Compilers
The Distributed Shared Memory (DSM) model is designed to leverage the ease of programming of the shared memory paradigm, while enabling the highperformance by expressing locality ...
François Cantonnet, Tarek A. El-Ghazawi, Pa...
PADS
2005
ACM
15 years 4 months ago
Routing Worm: A Fast, Selective Attack Worm Based on IP Address Information
Most well-known Internet worms, such as Code Red, Slammer, and Blaster, infected vulnerable computers by scanning the entire Internet IPv4 space. In this paper, we present a new s...
Cliff Changchun Zou, Donald F. Towsley, Weibo Gong...
EDBT
2009
ACM
164views Database» more  EDBT 2009»
15 years 3 months ago
Fast object search on road networks
In this paper, we present ROAD, a general framework to evaluate Location-Dependent Spatial Queries (LDSQ)s that searches for spatial objects on road networks. By exploiting search...
Ken C. K. Lee, Wang-Chien Lee, Baihua Zheng
FPGA
1999
ACM
139views FPGA» more  FPGA 1999»
15 years 3 months ago
Trading Quality for Compile Time: Ultra-Fast Placement for FPGAs
The demand for high-speed FPGA compilation tools has occurred for three reasons: first, as FPGA device capacity has grown, the computation time devoted to placement and routing h...
Yaska Sankar, Jonathan Rose