Sciweavers

2297 search results - page 97 / 460
» A fast APRIORI implementation
Sort
View
SIAMSC
2008
117views more  SIAMSC 2008»
14 years 11 months ago
Adaptive, Fast, and Oblivious Convolution in Evolution Equations with Memory
To approximate convolutions which occur in evolution equations with memory terms, a variable-stepsize algorithm is presented for which advancing N steps requires only O(N log N) op...
María López-Fernández, Christ...
TVCG
2008
135views more  TVCG 2008»
14 years 11 months ago
A Fast and Stable Penalty Method for Rigid Body Simulation
Two methods have been used extensively to model resting contact for rigid body simulation. The first approach, the penalty method, applies virtual springs to surfaces in contact to...
Evan Drumwright
AROBOTS
2002
91views more  AROBOTS 2002»
14 years 11 months ago
Fast, On-Line Learning of Globally Consistent Maps
To navigate in unknown environments, mobile robots require the ability to build their own maps. A major problem for robot map building is that odometry-based dead reckoning cannot ...
Tom Duckett, Stephen Marsland, Jonathan Shapiro
IJCV
2000
109views more  IJCV 2000»
14 years 11 months ago
Fast Lighting Independent Background Subtraction
This paper describes a simple method of fast background subtraction based upon disparity verification that is invariant to arbitrarily rapid run-time changes in illumination. Using...
Yuri A. Ivanov, Aaron F. Bobick, John Liu
77
Voted
JUCS
2002
179views more  JUCS 2002»
14 years 10 months ago
A Fast and Simple Algorithm for Constructing Minimal Acyclic Deterministic Finite Automata
: In this paper, we present a fast and simple algorithm for constructing a minimal acyclic deterministic finite automaton from a finite set of words. Such automata are useful in a ...
Bruce W. Watson