16666 search results - page 2598 / 3334 » Descriptive and Computational Complexity |
236
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
Abstract--Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typi...
169
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
We consider linear precoding and decoding in the downlink of a multiuser multiple-input, multipleoutput (MIMO) system, wherein each user may receive more than one data stream. We ...
211
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...
174
click to vote
ENTCS
2010
15 years 7 months ago
2010
The crucial strength of the component paradigm lies in the possibility to encapsulate behaviours. In this work, we focus on the observable behaviour of composite components which ...
145
click to vote
ALIFE
2006
15 years 7 months ago
2006
We present a new bio-inspired approach applied to a problem of stereo image matching. This approach is based on an artificial epidemic process, which we call the infection algorith...