206 search results - page 33 / 42 » Simplifying failure-inducing input |
DAC
2006
ACM
14 years 8 months ago
2006
ACM
SAT sweeping is a method for simplifying an AND/INVERTER graph (AIG) by systematically merging graph vertices from the inputs towards the outputs using a combination of structural...
ICML
2004
IEEE
14 years 8 months ago
2004
IEEE
In kernel methods, an interesting recent development seeks to learn a good kernel from empirical data automatically. In this paper, by regarding the transductive learning of the k...
WWW
2004
ACM
14 years 8 months ago
2004
ACM
While we expect to discover knowledge in the texts available on the Web, such discovery usually requires many complex analysis steps, most of which require different text handling...
PERCOM
2004
ACM
14 years 7 months ago
2004
ACM
Connectivity is central to pervasive computing environments. We seek to catalyze a world of rich and diverse connectivity through technologies that drastically simplify the task o...
MOBIHOC
2002
ACM
14 years 7 months ago
2002
ACM
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...