Sciweavers

2297 search results - page 111 / 460
» A fast APRIORI implementation
Sort
View
SMA
2010
ACM
231views Solid Modeling» more  SMA 2010»
15 years 4 months ago
Fast and robust retrieval of Minkowski sums of rotating convex polyhedra in 3-space
We present a novel method for fast retrieval of exact Minkowski sums of pairs of convex polytopes in R3 , where one of the polytopes keeps rotating. The algorithm is based on pre-...
Naama Mayer, Efi Fogel, Dan Halperin
ICDE
2011
IEEE
265views Database» more  ICDE 2011»
14 years 8 months ago
RAFTing MapReduce: Fast recovery on the RAFT
MapReduce is a computing paradigm that has gained a lot of popularity as it allows non-expert users to easily run complex analytical tasks at very large-scale. At such scale, task...
Jorge-Arnulfo Quiané-Ruiz, Christoph Pinkel...
ERSA
2008
105views Hardware» more  ERSA 2008»
15 years 6 months ago
Dynamically Reconfigurable FFTs for Cognitive Radio on a Multiprocessor Platform
Multiprocessor platforms have been proposed as an enabling technology for Cognitive Radio. In this paper, we explore various FFT implementations on a multiprocessor prototype platf...
Qiwei Zhang, Karel Walters, André B. J. Kok...
145
Voted
FSE
1997
Springer
131views Cryptology» more  FSE 1997»
15 years 8 months ago
Fast Software Encryption: Designing Encryption Algorithms for Optimal Software Speed on the Intel Pentium Processor
Most encryption algorithms are designed without regard to their performance on top-of-the-line microprocessors. This paper discusses general optimization principles algorithms desi...
Bruce Schneier, Doug Whiting
BROADNETS
2004
IEEE
15 years 8 months ago
Capacity-Efficient Protection with Fast Recovery in Optically Transparent Mesh Networks
Survivability becomes increasingly critical in managing high-speed networks as data traffic continues to grow in both size and importance. In addition, the impact of failures is e...
Sun-il Kim, Steven S. Lumetta