Sciweavers

10146 search results - page 1910 / 2030
» Fast FAST
Sort
View
CF
2005
ACM
13 years 11 months ago
Controlling leakage power with the replacement policy in slumberous caches
As technology scales down at an exponential rate, leakage power is fast becoming the dominant component of the total power budget. A large share of the total leakage power is diss...
Nasir Mohyuddin, Rashed Bhatti, Michel Dubois
CIKM
2006
Springer
13 years 11 months ago
Efficiently clustering transactional data with weighted coverage density
In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the c...
Hua Yan, Keke Chen, Ling Liu
CPM
2005
Springer
100views Combinatorics» more  CPM 2005»
13 years 11 months ago
Hardness of Optimal Spaced Seed Design
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
François Nicolas, Eric Rivals
CRV
2005
IEEE
342views Robotics» more  CRV 2005»
13 years 11 months ago
PDE-Based Robust Robotic Navigation
In robotic navigation, path planning is aimed at getting the optimum collision-free path between a starting and target locations. The optimality criterion depends on the surroundi...
M. Sabry Hassouna, Alaa E. Abdel-Hakim, Aly A. Far...
DIS
2006
Springer
13 years 11 months ago
Change Detection with Kalman Filter and CUSUM
Knowledge discovery systems are constrained by three main limited resources: time, memory and sample size. Sample size is traditionally the dominant limitation, but in many present...
Milton Severo, João Gama
« Prev « First page 1910 / 2030 Last » Next »