Sciweavers

2944 search results - page 5 / 589
» On Well Quasi-orders on Languages
Sort
View
ACL
2006
13 years 8 months ago
Learning to Say It Well: Reranking Realizations by Predicted Synthesis Quality
This paper presents a method for adapting a language generator to the strengths and weaknesses of a synthetic voice, thereby improving the naturalness of synthetic speech in a spo...
Crystal Nakatsu, Michael White
ICALP
2007
Springer
13 years 11 months ago
Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games
Abstract. In this work we study the tractability of well supported approximate Nash Equilibria (SuppNE in short) in bimatrix games. In view of the apparent intractability of constr...
Spyros C. Kontogiannis, Paul G. Spirakis
VL
2005
IEEE
119views Visual Languages» more  VL 2005»
14 years 1 months ago
How Well Do Professional Developers Test with Code Coverage Visualizations? An Empirical Study
Despite years of availability of testing tools, professional software developers still seem to need better support to determine the effectiveness of their tests. Without improveme...
Joseph Lawrance, Steven Clarke, Margaret M. Burnet...
ICALP
2005
Springer
14 years 29 days ago
Preservation Under Extensions on Well-Behaved Finite Structures
A class of relational structures is said to have the extension preservation property if every first-order sentence that is preserved under extensions on the class is equivalent t...
Albert Atserias, Anuj Dawar, Martin Grohe
CAISE
2004
Springer
14 years 26 days ago
An Ontologically Well-Founded Profile for UML Conceptual Models
UML class diagrams can be used as a language for expressing a conceptual model of a domain. In a series of papers [1,2,3] we have been using the General Ontological Language (GOL) ...
Giancarlo Guizzardi, Gerd Wagner, Nicola Guarino, ...