Sciweavers

348 search results - page 8 / 70
» Using Curvature Information for Fast Stochastic Search
Sort
View
MAM
2006
95views more  MAM 2006»
14 years 9 months ago
Stochastic spatial routing for reconfigurable networks
FPGA placement and routing is time consuming, often serving as the major obstacle inhibiting a fast edit-compile-test loop in prototyping and development and the major obstacle pr...
André DeHon, Randy Huang, John Wawrzynek
BMCBI
2007
115views more  BMCBI 2007»
14 years 9 months ago
A novel, fast, HMM-with-Duration implementation - for application with a new, pattern recognition informed, nanopore detector
Background: Hidden Markov Models (HMMs) provide an excellent means for structure identification and feature extraction on stochastic sequential data. An HMM-with-Duration (HMMwD) ...
Stephen Winters-Hilt, Carl Baribault
ECCV
2004
Springer
15 years 11 months ago
Dynamic Visual Search Using Inner-Scene Similarity: Algorithms and Inherent Limitations
Abstract. A dynamic visual search framework based mainly on innerscene similarity is proposed. Algorithms as well as measures quantifying the difficulty of search tasks are suggest...
Tamar Avraham, Michael Lindenbaum
SIGGRAPH
1996
ACM
15 years 1 months ago
Combining Frequency and Spatial Domain Information for Fast Interactive Image Noise Removal
Scratches on old films must be removed since these are more noticeable on higher definition and digital televisions. Wires that suspend actors or cars must be carefully erased dur...
Anil N. Hirani, Takashi Totsuka
ICRA
2009
IEEE
163views Robotics» more  ICRA 2009»
15 years 4 months ago
On fast surface reconstruction methods for large and noisy point clouds
— In this paper we present a method for fast surface reconstruction from large noisy datasets. Given an unorganized 3D point cloud, our algorithm recreates the underlying surface...
Zoltan Csaba Marton, Radu Bogdan Rusu, Michael Bee...