4860 search results - page 289 / 972 » SNPs Problems, Complexity, and Algorithms |
191
click to vote
STOC
1993
ACM
15 years 4 months ago
1993
ACM
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
127
Voted
MOBIHOC
2008
ACM
16 years 9 days ago
2008
ACM
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
114
click to vote
CN
1998
15 years 13 days 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...
126
click to vote
TSP
2011
14 years 7 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...
125
click to vote
STOC
2009
ACM
16 years 1 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...