Sciweavers

2297 search results - page 144 / 460
» A fast APRIORI implementation
Sort
View
CVPR
2006
IEEE
16 years 1 months ago
Control Theory and Fast Marching Techniques for Brain Connectivity Mapping
We propose a novel, fast and robust technique for the computation of anatomical connectivity in the brain. Our approach exploits the information provided by Diffusion Tensor Magne...
Emmanuel Prados, Stefano Soatto, Christophe Lengle...
MOBIHOC
2008
ACM
15 years 10 months ago
Fast and quality-guaranteed data streaming in resource-constrained sensor networks
In many emerging applications, data streams are monitored in a network environment. Due to limited communication bandwidth and other resource constraints, a critical and practical...
Emad Soroush, Kui Wu, Jian Pei
ISPD
2005
ACM
174views Hardware» more  ISPD 2005»
15 years 4 months ago
Fast and accurate rectilinear steiner minimal tree algorithm for VLSI design
In this paper, we present a very fast and accurate rectilinear Steiner minimal tree (RSMT)1 algorithm called FLUTE. The algorithm is an extension of the wirelength estimation appr...
Chris C. N. Chu, Yiu-Chung Wong
EDBT
2009
ACM
277views Database» more  EDBT 2009»
15 years 3 months ago
G-hash: towards fast kernel-based similarity search in large graph databases
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...
Xiaohong Wang, Aaron M. Smalter, Jun Huan, Gerald ...
BIRTHDAY
2012
Springer
13 years 7 months ago
Masking with Randomized Look Up Tables - Towards Preventing Side-Channel Attacks of All Orders
We propose a new countermeasure to protect block ciphers implemented in leaking devices, at the intersection between One-Time Programs and Boolean masking schemes. First, we show t...
François-Xavier Standaert, Christophe Petit...