Sciweavers

3630 search results - page 215 / 726
» Fast Marching Methods
Sort
View
DDECS
2009
IEEE
128views Hardware» more  DDECS 2009»
16 years 1 months ago
A fast untestability proof for SAT-based ATPG
—Automatic Test Pattern Generation (ATPG) based on Boolean satisfiability (SAT) has been shown to be a beneficial complement to traditional ATPG techniques. Boolean solvers wor...
Daniel Tille, Rolf Drechsler
IEEEIAS
2009
IEEE
16 years 1 months ago
Octagonal Search Algorithm with Early Termination for Fast Motion Estimation on H.264
: An adaptive threshold for early termination is proposed in this paper to enhance the cross octagonal search algorithm (COSA)[1]. In block motion estimation, search patterns have ...
Zhaopeng Cui, Dujuan Wang, Guang Jiang, Chengke Wu
FDG
2009
ACM
16 years 1 months ago
Very fast action selection for parameterized behaviors
In this paper, I will discuss a set of techniques for supporting limited variable binding in behavior-based systems. This adds additional useful expressivity while preserving the ...
Ian Horswill
DATE
2008
IEEE
116views Hardware» more  DATE 2008»
16 years 28 days ago
Fast Analog Circuit Synthesis Using Sensitivity Based Near Neighbor Searches
We present an efficient analog synthesis algorithm employing regression models of circuit matrices. Circuit matrix models achieve accurate and speedy synthesis of analog circuits...
Almitra Pradhan, Ranga Vemuri
ICPR
2008
IEEE
16 years 27 days ago
Fast multiple instance learning via L1, 2 logistic regression
In this paper, we develop an efficient logistic regression model for multiple instance learning that combines L1 and L2 regularisation techniques. An L1 regularised logistic regr...
Zhouyu Fu, Antonio Robles-Kelly