Sciweavers

10146 search results - page 224 / 2030
» Fast FAST
Sort
View
KDD
1998
ACM
200views Data Mining» more  KDD 1998»
15 years 8 months ago
Fast Computation of 2-Dimensional Depth Contours
"Oneperson's noise is another person's signal." For manyapplications, including the detection of credit card frauds and the monitoringof criminal activities in...
Theodore Johnson, Ivy Kwok, Raymond T. Ng
KDD
1998
ACM
145views Data Mining» more  KDD 1998»
15 years 8 months ago
Coincidence Detection: A Fast Method for Discovering Higher-Order Correlations in Multidimensional Data
Wepresent a novel, fast methodfor associationminingill high-dimensionaldatasets. OurCoincidence Detection method, which combines random sampling and Chernoff-Hoeffding bounds with...
Evan W. Steeg, Derek A. Robinson, Ed Willis
VISUALIZATION
1997
IEEE
15 years 8 months ago
Fast oriented line integral convolution for vector field visualization via the Internet
Oriented Line Integral Convolution (OLIC) illustrates flow fields by convolving a sparse texture with an anisotropic convolution kernel. The kernel is aligned to the underlying ...
Rainer Wegenkittl, Eduard Gröller
SIGCOMM
1997
ACM
15 years 8 months ago
Small Forwarding Tables for Fast Routing Lookups
For some time, the networking communityhas assumed that it is impossible to do IP routing lookups in software fast enough to support gigabit speeds. IP routing lookups must nd th...
Mikael Degermark, Andrej Brodnik, Svante Carlsson,...
CRYPTO
1997
Springer
156views Cryptology» more  CRYPTO 1997»
15 years 8 months ago
Fast and Secure Hashing Based on Codes
This paper considers hash functions based on block ciphers. It presents a new attack on the compression function of the 128-bit hash function MDC-4 using DES with a complexity far ...
Lars R. Knudsen, Bart Preneel