Sciweavers

5855 search results - page 138 / 1171
» Test generation and minimization with
Sort
View
ACL
2001
15 years 2 months ago
What is the Minimal Set of Fragments that Achieves Maximal Parse Accuracy?
We aim at finding the minimal set of fragments which achieves maximal parse accuracy in Data Oriented Parsing. Experiments with the Penn Wall Street Journal treebank show that cou...
Rens Bod
ML
2010
ACM
138views Machine Learning» more  ML 2010»
14 years 8 months ago
Mining adversarial patterns via regularized loss minimization
Traditional classification methods assume that the training and the test data arise from the same underlying distribution. However, in several adversarial settings, the test set is...
Wei Liu, Sanjay Chawla
MEMBRANE
2004
Springer
15 years 7 months ago
Communicative P Systems with Minimal Cooperation
We proved that two classes of Communicative P systems with 3 membranes and with minimal cooperation, namely P systems with symport/antiport rules of size 1 and and P systems with s...
Artiom Alhazov, Maurice Margenstern, Vladimir Rogo...
DSD
2010
IEEE
171views Hardware» more  DSD 2010»
15 years 3 days ago
Test Patterns Compression Technique Based on a Dedicated SAT-Based ATPG
— In this paper we propose a new method of test patterns compression based on a design of a dedicated SAT-based ATPG (Automatic Test Pattern Generator). This compression method i...
Jiri Balcarek, Petr Fiser, Jan Schmidt
ICDM
2009
IEEE
145views Data Mining» more  ICDM 2009»
14 years 11 months ago
Significance of Episodes Based on Minimal Windows
Discovering episodes, frequent sets of events from a sequence has been an active field in pattern mining. Traditionally, a level-wise approach is used to discover all frequent epis...
Nikolaj Tatti