Sciweavers

624 search results - page 47 / 125
» Test set compaction algorithms for combinational circuits
Sort
View
IPMI
2007
Springer
16 years 5 months ago
Active Mean Fields: Solving the Mean Field Approximation in the Level Set Framework
Abstract. We describe a new approach for estimating the posterior probability of tissue labels. Conventional likelihood models are combined with a curve length prior on boundaries,...
Kilian M. Pohl, Ron Kikinis, William M. Wells III
VTS
2006
IEEE
93views Hardware» more  VTS 2006»
15 years 10 months ago
Upper Bounding Fault Coverage by Structural Analysis and Signal Monitoring
A new algorithm for identifying stuck faults in combinational circuits that cannot be detected by a given input sequence is presented. Other than pre and post-processing steps, ce...
Vishwani D. Agrawal, Soumitra Bose, Vijay Gangaram
EMNLP
2008
15 years 5 months ago
Automatic Set Expansion for List Question Answering
This paper explores the use of set expansion (SE) to improve question answering (QA) when the expected answer is a list of entities belonging to a certain class. Given a small set...
Richard C. Wang, Nico Schlaefer, William W. Cohen,...
TCAD
2002
110views more  TCAD 2002»
15 years 3 months ago
A constructive genetic algorithm for gate matrix layout problems
This paper describes an application of a Constructive Genetic Algorithm (CGA) to the Gate Matrix Layout Problem (GMLP). The GMLP happens in very large scale integration (VLSI) desi...
Alexandre César Muniz de Oliveira, Luiz Ant...
WABI
2009
Springer
117views Bioinformatics» more  WABI 2009»
15 years 10 months ago
A Simulation Study Comparing Supertree and Combined Analysis Methods Using SMIDGen
Background: Supertree methods comprise one approach to reconstructing large molecular phylogenies given multi-marker datasets: trees are estimated on each marker and then combined...
M. Shel Swenson, François Barbançon,...