Sciweavers

2297 search results - page 141 / 460
» A fast APRIORI implementation
Sort
View
TC
2010
14 years 9 months ago
Dynamic Multiway Segment Tree for IP Lookups and the Fast Pipelined Search Engine
—A dynamic multiway segment tree (DMST) is proposed for IP lookups in this paper. DMST is designed for dynamic routing tables that can dynamically insert and delete prefixes. DMS...
Yeim-Kuan Chang, Yung-Chieh Lin, Cheng-Chien Su
CHI
2010
ACM
14 years 9 months ago
Protractor: a fast and accurate gesture recognizer
Protractor is a novel gesture recognizer that can be easily implemented and quickly customized for different users. Protractor uses a nearest neighbor approach, which recognizes a...
Yang Li
ICIP
2010
IEEE
14 years 9 months ago
Fast bilateral filtering by adapting block size
Direct implementations of bilateral filtering show O(r2 ) computational complexity per pixel, where r is the filter window radius. Several lower complexity methods have been devel...
Wei Yu, Franz Franchetti, James C. Hoe, Yao-Jen Ch...
CGF
2010
165views more  CGF 2010»
14 years 8 months ago
Fast Particle-based Visual Simulation of Ice Melting
The visual simulation of natural phenomena has been widely studied. Although several methods have been proposed to simulate melting, the flows of meltwater drops on the surfaces o...
Kei Iwasaki, H. Uchida, Yoshinori Dobashi, Tomoyuk...
JCNS
2010
90views more  JCNS 2010»
14 years 6 months ago
Fast Kalman filtering on quasilinear dendritic trees
Optimal filtering of noisy voltage signals on dendritic trees is a key problem in computational cellular neuroscience. However, the state variable in this problem -- the vector of...
Liam Paninski