Sciweavers

867 search results - page 71 / 174
» Network Robustness and Graph Topology
Sort
View
INTERSPEECH
2010
13 years 2 months ago
Hierarchical bottle neck features for LVCSR
This paper investigates the combination of different neural network topologies for probabilistic feature extraction. On one hand, a five-layer neural network used in bottle neck f...
Christian Plahl, Ralf Schlüter, Hermann Ney
WICON
2008
13 years 9 months ago
On the practical complexity of solving the maximum weighted independent set problem for optimal scheduling in wireless networks
It is well known that the maximum weighted independent set (MWIS) problem is NP-complete. Moreover, optimal scheduling in wireless networks requires solving a MWIS problem. Conseq...
Peng Wang, Stephan Bohacek
INFOCOM
2008
IEEE
14 years 2 months ago
Swarming on Optimized Graphs for n-Way Broadcast
—In an n-way broadcast application each one of n overlay nodes wants to push its own distinct large data file to all other n-1 destinations as well as download their respective ...
Georgios Smaragdakis, Azer Bestavros, Nikolaos Lao...
ATMOS
2010
136views Optimization» more  ATMOS 2010»
13 years 6 months ago
An Empirical Analysis of Robustness Concepts for Timetabling
Calculating timetables that are insensitive to disturbances has drawn considerable research efforts due to its practical importance on the one hand and its hard tractability by c...
Marc Goerigk, Anita Schöbel
GLOBECOM
2010
IEEE
13 years 5 months ago
Compact Wakeup Scheduling in Wireless Sensor Networks
In a traditional wakeup scheduling, sensor nodes start up numerous times to communicate in a period, thus consuming extra energy due to state transitions (e.g. from the sleep state...
Junchao Ma, Wei Lou