Sciweavers

6833 search results - page 140 / 1367
» Some two-character sets
Sort
View
JSC
2010
102views more  JSC 2010»
15 years 2 months ago
Equational approximations for tree automata completion
In this paper we deal with the verification of safety properties of infinite-state systems modeled by term-rewriting systems. An over-approximation of the set of reachable terms...
Thomas Genet, Vlad Rusu
MEDBIOMETRICS
2010
15 years 2 months ago
A DIAMOND Method for Classifying Biological Data
This study proposes an effective method called DIAMOND to classify biological and medical data. Given a set of objects with some classes, DIAMOND separates the objects into differe...
Han-Lin Li, Yao-Huei Huang, Ming-Hsien Chen
IEAAIE
2010
Springer
15 years 2 months ago
Exploring the Performance of Resampling Strategies for the Class Imbalance Problem
The present paper studies the influence of two distinct factors on the performance of some resampling strategies for handling imbalanced data sets. In particular, we focus on the n...
Vicente García, José Salvador S&aacu...
TACAS
2010
Springer
170views Algorithms» more  TACAS 2010»
15 years 2 months ago
SLAB: A Certifying Model Checker for Infinite-State Concurrent Systems
Systems and protocols combining concurrency and infinite state space occur quite often in practice, but are very difficult to verify automatically. At the same time, if the system ...
Klaus Dräger, Andrey Kupriyanov, Bernd Finkbe...
IJAC
2008
84views more  IJAC 2008»
15 years 4 months ago
Groups whose Geodesics are Locally Testable
Abstract. A regular set of words is (k-)locally testable if membership of a word in the set is determined by the nature of its subwords of some bounded length k. In this article we...
Susan M. Hermiller, Derek F. Holt, Sarah Rees