Sciweavers

1693 search results - page 39 / 339
» fast 2008
Sort
View
ICPR
2008
IEEE
14 years 3 months ago
An online polygonal approximation of digital signals and curves with Dynamic Programming algorithm
A fast online algorithm was developed for polygonal approximation of signals and curves with a minimum number of line segments for a given constraint on the standard deviation of ...
Alexander Kolesnikov
CSDA
2008
94views more  CSDA 2008»
13 years 8 months ago
Robust model selection using fast and robust bootstrap
Robust model selection procedures control the undue influence that outliers can have on the selection criteria by using both robust point estimators and a bounded loss function wh...
Matias Salibian-Barrera, Stefan Van Aelst
STTT
2008
95views more  STTT 2008»
13 years 8 months ago
FAST: acceleration from theory to practice
Abstract. Fast is a tool for the analysis of systems manipulating unbounded integer variables. We check safety properties by computing the reachability set of the system under stud...
Sébastien Bardin, Alain Finkel, Jér&...
VLSISP
2002
87views more  VLSISP 2002»
13 years 8 months ago
A 16-Bit by 16-Bit MAC Design Using Fast 5: 3 Compressor Cells
3:2 counters and 4:2 compressors have been widely used for multiplier implementations. In this paper, a fast 5:3 compressor is derived for high-speed multiplier implementations. Th...
Ohsang Kwon, Kevin J. Nowka, Earl E. Swartzlander ...
VMV
2008
164views Visualization» more  VMV 2008»
13 years 10 months ago
Vector Glyphs for Surfaces: A Fast and Simple Glyph Placement Algorithm for Adaptive Resolution Meshes
Visualization of flow on boundary surfaces from computational flow dynamics (CFD) is challenging due to the complex, adaptive resolution nature of the meshes used in the modeling ...
Zhenmin Peng, Robert S. Laramee