Sciweavers

923 search results - page 88 / 185
» Proving the value of formal methods
Sort
View
FMCAD
2004
Springer
15 years 11 months ago
Increasing the Robustness of Bounded Model Checking by Computing Lower Bounds on the Reachable States
Most symbolic model checkers are based on either Binary Decision Diagrams (BDDs), which may grow exponentially large, or Satisfiability (SAT) solvers, whose time requirements rapi...
Mohammad Awedh, Fabio Somenzi
JCIT
2008
112views more  JCIT 2008»
15 years 6 months ago
On the design of metric relations
Metric distances and the more general concept of dissimilarities are widely used tools in instance-based learning methods and very especially in the nearestneighbor classification...
Lluís Belanche, Jorge Orozco
DAC
2012
ACM
13 years 8 months ago
Improving gate-level simulation accuracy when unknowns exist
Unknown values (Xs) may exist in a design due to uninitialized registers or blocks that are powered down. Due to X-pessimism in gate-level logic simulation, such Xs cannot be hand...
Kai-Hui Chang, Chris Browy
ICASSP
2008
IEEE
16 years 19 days ago
Robust kernel density estimation
In this paper, we propose a method for robust kernel density estimation. We interpret a KDE with Gaussian kernel as the inner product between a mapped test point and the centroid ...
JooSeuk Kim, Clayton Scott
EVOW
2004
Springer
15 years 11 months ago
Evolutionary Search of Thresholds for Robust Feature Set Selection: Application to the Analysis of Microarray Data
Abstract. We deal with two important problems in pattern recognition that arise in the analysis of large datasets. While most feature subset selection methods use statistical techn...
Carlos Cotta, Christian Sloper, Pablo Moscato