Sciweavers

2297 search results - page 121 / 460
» A fast APRIORI implementation
Sort
View
MDM
2009
Springer
118views Communications» more  MDM 2009»
15 years 5 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...
PAIRING
2009
Springer
124views Cryptology» more  PAIRING 2009»
15 years 5 months ago
Fast Hashing to G2 on Pairing-Friendly Curves
When using pairing-friendly ordinary elliptic curves over prime fields to implement identity-based protocols, there is often a need to hash identities to points on one or both of ...
Michael Scott, Naomi Benger, Manuel Charlemagne, L...
ICIP
2008
IEEE
15 years 5 months ago
A fast level set algorithm for shape-based segmentation with multiple selective priors
This paper addresses the shape-based segmentation problem using level sets. In particular, we propose a fast algorithm to solve the piece-wise constant Chan-Vese segmentation mode...
Rachid Fahmi, Aly A. Farag
75
Voted
ICPP
2008
IEEE
15 years 5 months ago
TPTS: A Novel Framework for Very Fast Manycore Processor Architecture Simulation
The slow speed of conventional execution-driven architecture simulators is a serious impediment to obtaining desirable research productivity. This paper proposes and evaluates a f...
Sangyeun Cho, Socrates Demetriades, Shayne Evans, ...
ICDIM
2007
IEEE
15 years 5 months ago
Fast Send Protocol - minimizing sending time in high-speed bulk data transfers
Over the last decades Internet traffic has grown dramatically. Besides the number of transfers, data sizes have risen as well. Traditional transfer protocols do not adapt to this...
Christoph Koch, Tilmann Rabl, Günther Hö...