Sciweavers

953 search results - page 85 / 191
» On the Pagination of Complex Documents
Sort
View
SPEECH
2010
94views more  SPEECH 2010»
13 years 4 months ago
Predicting the phonetic realizations of word-final consonants in context - A challenge for French grapheme-to-phoneme converters
One of the main problems in developing a text-to-speech (TTS) synthesizer for French lies in grapheme-to-phoneme conversion. Automatic converters produce still too many errors in ...
Josafá de Jesus Aguiar Pontes, Sadaoki Furu...
CGO
2011
IEEE
13 years 1 months ago
Practical memory checking with Dr. Memory
—Memory corruption, reading uninitialized memory, using freed memory, and other memory-related errors are among the most difficult programming bugs to identify and fix due to t...
Derek Bruening, Qin Zhao
CIKM
2011
Springer
12 years 10 months ago
Ranking-based processing of SQL queries
A growing number of applications are built on top of search engines and issue complex structured queries. This paper contributes a customisable ranking-based processing of such qu...
Hany Azzam, Thomas Roelleke, Sirvan Yahyaei
ICDT
2012
ACM
226views Database» more  ICDT 2012»
12 years 14 days ago
Bounded repairability for regular tree languages
We consider the problem of repairing unranked trees (e.g., XML documents) satisfying a given restriction specification R (e.g., a DTD) into unranked trees satisfying a given targ...
Gabriele Puppis, Cristian Riveros, Slawek Staworko
ICSE
2009
IEEE-ACM
14 years 11 months ago
In-field healing of integration problems with COTS components
Developers frequently integrate complex COTS frameworks and components in software applications. COTS products are often only partially documented, and developers may misuse techn...
Hervé Chang, Leonardo Mariani, Mauro Pezz&e...