Sciweavers

999 search results - page 188 / 200
» On the Decidability of Functional Uncertainty
Sort
View
COST
2007
Springer
116views Multimedia» more  COST 2007»
14 years 1 months ago
ECESS Platform for Web Based TTS Modules and Systems Evaluation
The paper presents platform for web based TTS modules and systems evaluation named RES (Remote Evaluation System). It is being developed within the European Centre of Excellence fo...
Matej Rojc, Harald Höge, Zdravko Kacic
GCB
2007
Springer
91views Biometrics» more  GCB 2007»
14 years 1 months ago
Integrative Analysis of Transcriptome and Metabolome Data
Biological systems have to react to environmental and/or developmental changes by adjusting their biochemical/cellular machinery on numerous levels. In many cases small molecules ...
Lothar Willmitzer, Camila Caldana, Alisdair R. Fer...
RTAS
2005
IEEE
14 years 1 months ago
Out-of-Norm Assertions
Abstract— The increasing use of electronics in transport systems, such as the automotive and avionic domain, has lead to dramatic improvements with respect to functionality, safe...
Philipp Peti, Roman Obermaisser, Hermann Kopetz
TLDI
2005
ACM
102views Formal Methods» more  TLDI 2005»
14 years 1 months ago
An open and shut typecase
Two different ways of defining ad-hoc polymorphic operations commonly occur in programming languages. With the first form polymorphic operations are defined inductively on the...
Dimitrios Vytiniotis, Geoffrey Washburn, Stephanie...
COCO
2005
Springer
123views Algorithms» more  COCO 2005»
14 years 1 months ago
If NP Languages are Hard on the Worst-Case Then It is Easy to Find Their Hard Instances
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma