Sciweavers

1279 search results - page 92 / 256
» Fast Implementations of Automata Computations
Sort
View
KDD
2007
ACM
144views Data Mining» more  KDD 2007»
14 years 10 months ago
Fast direction-aware proximity for graph mining
In this paper we study asymmetric proximity measures on directed graphs, which quantify the relationships between two nodes or two groups of nodes. The measures are useful in seve...
Hanghang Tong, Christos Faloutsos, Yehuda Koren
CEC
2008
IEEE
14 years 4 months ago
Fast symmetric keys generation via mutual mirroring process
—This paper presents an eavesdropper-proof algorithm that is capable of fast generating symmetric (secret) keys. Instead of literally exchanging secret keys, both the sender and ...
Chun-Shun Tseng, Ya-Yun Jheng, Sih-Yin Shen, Jung-...
ANCS
2006
ACM
14 years 4 months ago
WormTerminator: an effective containment of unknown and polymorphic fast spreading worms
The fast spreading worm is becoming one of the most serious threats to today’s networked information systems. A fast spreading worm could infect hundreds of thousands of hosts w...
Songqing Chen, Xinyuan Wang, Lei Liu, Xinwen Zhang
ICIP
1998
IEEE
14 years 11 months ago
Fast Blind Inverse Halftoning
We present a fast, non-iterative technique for producing grayscale images from error diffused and dithered halftones. The first stage of the algorithm consists of a Gaussian filte...
Niranjan Damera-Venkata, Thomas D. Kite, Mahalaksh...
MDM
2009
Springer
118views Communications» more  MDM 2009»
14 years 4 months ago
DigestJoin: Exploiting Fast Random Reads for Flash-Based Joins
Abstract—Flash disks have been an emerging secondary storage media. In particular, there have been portable devices, multimedia players and laptop computers that are configured ...
Yu Li, Sai Tung On, Jianliang Xu, Byron Choi, Haib...