9842 search results - page 1904 / 1969 » The Complexity of the Matching-Cut Problem |
DAC
2007
ACM
14 years 8 months ago
2007
ACM
tive Guidance Strategy for Abstraction-Guided Simulation Flavio M. De Paula Alan J. Hu Department of Computer Science, University of British Columbia, {depaulfm, ajh}@cs.ubc.ca D...
DAC
2005
ACM
14 years 8 months ago
2005
ACM
The challenge of verifying a modern microprocessor design is an overwhelming one: Increasingly complex micro-architectures combined with heavy time-to-market pressure have forced ...
IPMI
2001
Springer
14 years 8 months ago
2001
Springer
Statistical analysis of anatomical shape differences between two different populations can be reduced to a classification problem, i.e., learning a classifier function for assignin...
ICML
2009
IEEE
14 years 8 months ago
2009
IEEE
The promise of unsupervised learning methods lies in their potential to use vast amounts of unlabeled data to learn complex, highly nonlinear models with millions of free paramete...
ICML
2004
IEEE
14 years 8 months ago
2004
IEEE
In many application domains there is a large amount of unlabeled data but only a very limited amount of labeled training data. One general approach that has been explored for util...