2899 search results - page 200 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
170
click to vote
CN
1998
15 years 6 months ago
1998
Connection preemption provides available and reliable services to high-priority connections when a network is heavily loaded and connection request arrival patterns are unknown, o...
202
click to vote
TSP
2011
15 years 1 months ago
2011
—This work proposes a blind adaptive reduced-rank scheme and constrained constant-modulus (CCM) adaptive algorithms for interference suppression in wireless communications system...
193
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
Linear programming decoding for low-density parity check codes (and related domains such as compressed sensing) has received increased attention over recent years because of its p...
190
click to vote
IPPS
1997
IEEE
15 years 10 months ago
1997
IEEE
In this paper we show the power of sampling techniques in designing efficient distributed algorithms. In particular, we show that using sampling techniques, on some networks, sele...
169
click to vote
ADBIS
1998
Springer
15 years 10 months ago
1998
Springer
In order to answer efficiently range queries in 2-d R-trees, first we sort queries by means of a space filling curve, then we group them together, and finally pass them for process...