Sciweavers

8196 search results - page 313 / 1640
» Computational Modeling and Complexity Science
Sort
View
SOFSEM
2009
Springer
16 years 3 months ago
Polylog Space Compression Is Incomparable with Lempel-Ziv and Pushdown Compression
This paper considers online compression algorithms that use at most polylogarithmic space (plogon). These algorithms correspond to compressors in the data stream model. We study th...
Elvira Mayordomo, Philippe Moser
GI
2005
Springer
16 years 5 days ago
A Voiceportal Enhanced by Semantic Processing and Affect Awareness
: In order to improve the automation rate of state-of-the-art IVR systems we introduce the application of two key technologies. Semantic processing is performed to analyze the inpu...
Felix Burkhardt, Joachim Stegmann, Markus Van Ball...
WG
2005
Springer
16 years 4 days ago
Channel Assignment and Improper Choosability of Graphs
Abstract. We model a problem proposed by Alcatel, a satellite building company, using improper colourings of graphs. The relation between improper colourings and maximum average de...
Frédéric Havet, Jean-Sébastie...
GI
2004
Springer
16 years 1 days ago
Code Generator Testing in Practice
: This paper provides an overview of a practice-oriented testing approach for code generation tools. The main application area for the testing approach presented here is the testin...
Ingo Stürmer, Mirko Conrad
STACS
2004
Springer
16 years 3 hour ago
Topology Matters: Smoothed Competitiveness of Metrical Task Systems
We consider metrical task systems, a general framework to model online problems. Borodin, Linial and Saks [BLS92] presented a deterministic work function algorithm (WFA) for metric...
Guido Schäfer, Naveen Sivadasan