Sciweavers

1381 search results - page 132 / 277
» Fast Filtered Sampling
Sort
View
ICDAR
2005
IEEE
15 years 8 months ago
Fast Convolutional OCR with the Scanning N-Tuple Grid
This paper introduces a novel high speed convolutional character recognition system. Convolutional mode operation means that no prior localization or segmentation of characters is...
Simon M. Lucas, Kyu Tae Cho
ICIAR
2004
Springer
15 years 8 months ago
A Fast Probabilistic Bidirectional Texture Function Model
The bidirectional texture function (BTF) describes rough texture appearance variations due to varying illumination and viewing conditions. Such a function consists of thousands of ...
Michal Haindl, Jirí Filip
KDD
1998
ACM
145views Data Mining» more  KDD 1998»
15 years 6 months ago
Coincidence Detection: A Fast Method for Discovering Higher-Order Correlations in Multidimensional Data
Wepresent a novel, fast methodfor associationminingill high-dimensionaldatasets. OurCoincidence Detection method, which combines random sampling and Chernoff-Hoeffding bounds with...
Evan W. Steeg, Derek A. Robinson, Ed Willis
CODES
2004
IEEE
15 years 6 months ago
Hardware synthesis from coarse-grained dataflow specification for fast HW/SW cosynthesis
This paper concerns automatic hardware synthesis from data flow graph (DFG) specification for fast HW/SW cosynthesis. A node in DFG represents a coarse grain block such as FIR and...
Hyunuk Jung, Soonhoi Ha
119
Voted
CSDA
2008
94views more  CSDA 2008»
15 years 2 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