Sciweavers

593 search results - page 52 / 119
» An approach to benchmarking configuration complexity
Sort
View
DAC
1994
ACM
14 years 27 days ago
BDD Variable Ordering for Interacting Finite State Machines
We address the problem of obtaining good variable orderings for the BDD representation of a system of interacting finite state machines (FSMs). Orderings are derived from the comm...
Adnan Aziz, Serdar Tasiran, Robert K. Brayton
TGC
2010
Springer
13 years 6 months ago
Certified Result Checking for Polyhedral Analysis of Bytecode Programs
Static analysers are becoming so complex that it is crucial to ascertain the soundness of their results in a provable way. In this paper we develop a certified checker in Coq that ...
Frédéric Besson, Thomas P. Jensen, D...
AWIC
2011
Springer
13 years 12 days ago
DegExt - A Language-Independent Graph-Based Keyphrase Extractor
Abstract. In this paper, we introduce DegExt, a graph-based languageindependent keyphrase extractor,which extends the keyword extraction method described in [6]. We compare DegExt ...
Marina Litvak, Mark Last, Hen Aizenman, Inbal Gobi...
JMLR
2012
11 years 11 months ago
Multi-label Subspace Ensemble
A challenging problem of multi-label learning is that both the label space and the model complexity will grow rapidly with the increase in the number of labels, and thus makes the...
Tianyi Zhou, Dacheng Tao
MODELS
2007
Springer
14 years 2 months ago
Using Domain-Specific Modeling to Generate User Interfaces for Wizards
The rising adoption and incorporation of computers into everyday life requires human-computer interaction methods to be efficient and easy to understand. Simultaneously, complexit...
Enis Afgan, Jeffrey G. Gray, Purushotham Bangalore