Sciweavers

6365 search results - page 87 / 1273
» Fast Local Computation Algorithms
Sort
View
MVA
1998
110views Computer Vision» more  MVA 1998»
15 years 2 months ago
A fast algorithm for detecting die extrusion defects in IC packages
In this paper, we present a fast method for the detection of die extrusion defects in IC packages. The optical and lighting set-up as well as the details of the algorithm used for ...
H. Zhou, Ashraf A. Kassim, S. Ranganath
145
Voted
SCIA
2009
Springer
183views Image Analysis» more  SCIA 2009»
15 years 9 months ago
Globally Optimal Least Squares Solutions for Quasiconvex 1D Vision Problems
Abstract. Solutions to non-linear least squares problems play an essential role in structure and motion problems in computer vision. The predominant approach for solving these prob...
Carl Olsson, Martin Byröd, Fredrik Kahl
DLT
2010
15 years 3 months ago
Fast Parsing for Boolean Grammars: A Generalization of Valiant's Algorithm
Abstract. The well-known parsing algorithm for the context-free grammars due to Valiant ("General context-free recognition in less than cubic time", Journal of Computer a...
Alexander Okhotin
ML
2010
ACM
142views Machine Learning» more  ML 2010»
15 years 27 days ago
Fast adaptive algorithms for abrupt change detection
We propose two fast algorithms for abrupt change detection in streaming data that can operate on arbitrary unknown data distributions before and after the change. The first algor...
Daniel Nikovski, Ankur Jain
116
Voted
CSB
2002
IEEE
121views Bioinformatics» more  CSB 2002»
15 years 7 months ago
Fast and Sensitive Algorithm for Aligning ESTs to Human Genome
There is a pressing need to align growing set of expressed sequence tags (ESTs) to newly sequenced human genome. The problem is, however, complicated by the exon/intron structure ...
Jun Ogasawara, Shinichi Morishita