Sciweavers

1446 search results - page 168 / 290
» Testing for Concise Representations
Sort
View
CONCUR
1994
Springer
14 years 2 months ago
Composition and Behaviors of Probabilistic I/O Automata
We augment the I/O automaton model of Lynch and Tuttle with probability, as a step toward the ultimate goal of obtaining a useful tool for specifying and reasoning about asynchron...
Sue-Hwey Wu, Scott A. Smolka, Eugene W. Stark
DAC
1994
ACM
14 years 2 months 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
DEXAW
2007
IEEE
172views Database» more  DEXAW 2007»
14 years 2 months ago
X-SOM: A Flexible Ontology Mapper
System interoperability is a well known issue, especially for heterogeneous information systems, where ontologybased representations may support automatic and usertransparent inte...
Carlo Curino, Giorgio Orsi, Letizia Tanca
ICASSP
2007
IEEE
14 years 2 months ago
Multi-Channel Source Separation Preserving Spatial Information
In this paper we propose two novel methods for preserving the spatial information in source separation algorithms. Our approach is applicable to any source separation algorithm an...
Robert Aichner, Herbert Buchner, Meray Zourub, Wal...
ACSC
2004
IEEE
14 years 2 months ago
Strength Reduction for Loop-Invariant Types
Types are fundamental for enforcing levels of abstraction in modern high-level programming languages and their lower-level representations. However, some type-related features suc...
Phung Hua Nguyen, Jingling Xue