Sciweavers

876 search results - page 7 / 176
» Complexity in geometric SINR
Sort
View
PIMRC
2010
IEEE
13 years 5 months ago
Low-complexity admission control for distributed power-controlled networks with stochastic channels
This study addresses the general problem of efficient resource management in wireless networks with arbitrary timevarying topologies. Communication channels are assumed to generall...
Stepán Kucera, Bing Zhang
IPPS
2009
IEEE
14 years 2 months ago
Unit disk graph and physical interference model: Putting pieces together
Modeling communications in wireless networks is a challenging task since it asks for a simple mathematical object on which efficient algorithms can be designed, but that must also...
Emmanuelle Lebhar, Zvi Lotker
CLOR
2006
13 years 11 months ago
Object Recognition in the Geometric Era: A Retrospective
Recent advances in object recognition have emphasized the integration of intensity-derived features such as affine patches with associated geometric constraints leading to impressi...
Joseph L. Mundy
DAM
2008
102views more  DAM 2008»
13 years 7 months ago
On the computational complexity of partial covers of Theta graphs
By use of elementary geometric arguments we prove the existence of a special integral solution of a certain system of linear equations. The existence of such a solution yields the...
Jirí Fiala, Jan Kratochvíl, Attila P...
GLOBECOM
2007
IEEE
14 years 1 months ago
Geometric Decoding Of PAM and QAM Lattices
— A geometric decoding technique for finite lattices was presented by Seethaler et al. for flat-fading multiple-input multiple-output channels in the case of linear modulations...
Michael Samuel, Michael P. Fitz