Sciweavers

16404 search results - page 766 / 3281
» A set coverage problem
Sort
View
FOCS
2002
IEEE
16 years 13 days ago
Learning a Hidden Matching
We consider the problem of learning a matching (i.e., a graph in which all vertices have degree 0 or 1) in a model where the only allowed operation is to query whether a set of ve...
Noga Alon, Richard Beigel, Simon Kasif, Steven Rud...
ISMIS
1999
Springer
15 years 11 months ago
Machine Learning Method for Software Quality Model Building
Software quality prediction can be cast as a concept learning problem. In this paper, we discuss the full cycle of an application of Machine Learning to software quality predictio...
Mauricio Amaral de Almeida, Stan Matwin
KDD
1999
ACM
117views Data Mining» more  KDD 1999»
15 years 11 months ago
Identifying Distinctive Subsequences in Multivariate Time Series by Clustering
Most time series comparison algorithms attempt to discover what the members of a set of time series have in common. We investigate a di erent problem, determining what distinguish...
Tim Oates
RSCTC
2000
Springer
143views Fuzzy Logic» more  RSCTC 2000»
15 years 11 months ago
On Efficient Construction of Decision Trees from Large Databases
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...
Hung Son Nguyen
ICCAD
1991
IEEE
135views Hardware» more  ICCAD 1991»
15 years 11 months ago
DIATEST: A Fast Diagnostic Test Pattern Generator for Combinational Circuits
This paper presents an efficient algorithm for the generation of diagnostic test patterns which distinguish between two arbitrary single stuck-at faults. The algorithm is able to ...
Torsten Grüning, Udo Mahlstedt, Hartmut Koopm...