Sciweavers

782 search results - page 57 / 157
» Can a Parser be Generated from Examples
Sort
View
CDC
2009
IEEE
156views Control Systems» more  CDC 2009»
15 years 7 months ago
Input design using Markov chains for system identification
This paper studies the input design problem for system identification where time domain constraints have to be considered. A finite Markov chain is used to model the input of the s...
Chiara Brighenti, Bo Wahlberg, Cristian R. Rojas
RTAS
2006
IEEE
15 years 9 months ago
On Non-Utilization Bounds for Arbitrary Fixed Priority Policies
Prior research on schedulability bounds focused primarily on bounding utilization as a means to meet deadline constraints. Non-trivial bounds were found for a handful of schedulin...
Xue Liu, Tarek F. Abdelzaher
JSW
2007
133views more  JSW 2007»
15 years 3 months ago
New Functions for Unsupervised Asymmetrical Paraphrase Detection
Abstract— Monolingual text-to-text generation is an emerging research area in Natural Language Processing. One reason for the interest in such generation systems is the possibili...
João Cordeiro, Gaël Dias, Pavel Brazdi...
TVLSI
2008
152views more  TVLSI 2008»
15 years 3 months ago
MMV: A Metamodeling Based Microprocessor Validation Environment
With increasing levels of integration of multiple processing cores and new features to support software functionality, recent generations of microprocessors face difficult validati...
Deepak Mathaikutty, Sreekumar V. Kodakara, Ajit Di...
190
Voted
SIGMOD
2008
ACM
120views Database» more  SIGMOD 2008»
16 years 4 months ago
Muse: a system for understanding and designing mappings
Schema mappings are logical assertions that specify the relationships between a source and a target schema in a declarative way. The specification of such mappings is a fundamenta...
Bogdan Alexe, Laura Chiticariu, Renée J. Mi...