Sciweavers

2200 search results - page 353 / 440
» Bloch's Constant is Computable
Sort
View
TIT
2011
131views more  TIT 2011»
14 years 5 months ago
On the Hardness of Approximating the Network Coding Capacity
Abstract—This work addresses the computational complexity of achieving the capacity of a general network coding instance. We focus on the linear capacity, namely the capacity of ...
Michael Langberg, Alexander Sprintson
IJNSEC
2010
151views more  IJNSEC 2010»
14 years 4 months ago
Performance Evaluation of Mobility Speed over MANET Routing Protocols
Ad-hoc networking is a concept in computer communications. Each node participating in the network acts both as host and a router and must therefore is willing to forward packets f...
Yasser Kamal Hassan, Mohamed Hashim Abd El-Aziz, A...
INTERSPEECH
2010
14 years 4 months ago
Emotion recognition using imperfect speech recognition
This paper investigates the use of speech-to-text methods for assigning an emotion class to a given speech utterance. Previous work shows that an emotion extracted from text can c...
Florian Metze, Anton Batliner, Florian Eyben, Tim ...
MST
2010
86views more  MST 2010»
14 years 4 months ago
Fixed-Parameter Enumerability of Cluster Editing and Related Problems
Cluster Editing is transforming a graph by at most k edge insertions or deletions into a disjoint union of cliques. This problem is fixed-parameter tractable (FPT). Here we comput...
Peter Damaschke
SIAMMA
2010
81views more  SIAMMA 2010»
14 years 4 months ago
Heteroclinic Travelling Waves in Convex FPU-Type Chains
We consider infinite FPU-type atomic chains with general convex potentials and study the existence of monotone fronts that are heteroclinic travelling waves connecting constant asy...
Michael Herrmann, Jens D. M. Rademacher