Sciweavers

13603 search results - page 263 / 2721
» On the Complexity of Computing Treelength
Sort
View
MOBIHOC
2008
ACM
16 years 5 months ago
Complexity of scheduling with analog network coding
In this paper we analyze the complexity of scheduling wireless links in the physical interference model with analog network coding capability. We study two models with different d...
Olga Goussevskaia, Roger Wattenhofer
MOBIHOC
2007
ACM
16 years 5 months ago
Complexity in geometric SINR
In this paper we study the problem of scheduling wireless links in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane. We p...
Olga Goussevskaia, Yvonne Anne Oswald, Roger Watte...
ICC
2009
IEEE
190views Communications» more  ICC 2009»
16 years 21 days ago
Decomposition for Low-Complexity Near-Optimal Routing in Multi-Hop Wireless Networks
Abstract—Network flow models serve as a popular mathematical framework for the analysis and optimization of Multi-hop Wireless Networks. They also serve to provide the understan...
Vinay Kolar, Nael B. Abu-Ghazaleh, Petri Mäh&...
COMPLEX
2009
Springer
16 years 16 days ago
Composing Music with Complex Networks
—In this paper we study the network structure in music and attempt to compose music artificially. Networks are constructed with nodes and edges corresponding to musical notes an...
Xiaofan Liu, Chi Kong Tse, Michael Small
DEBS
2009
ACM
16 years 14 days ago
Distributed complex event processing with query rewriting
The nature of data in enterprises and on the Internet is changing. Data used to be stored in a database first and queried later. Today timely processing of new data, represented ...
Nicholas Poul Schultz-Møller, Matteo Miglia...