Sciweavers

4860 search results - page 212 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
TIP
2008
107views more  TIP 2008»
13 years 10 months ago
Sampling-Based Correlation Estimation for Distributed Source Coding Under Rate and Complexity Constraints
In many practical distributed source coding (DSC) applications, correlation information has to be estimated at the encoder in order to determine the encoding rate. Coding efficien...
Ngai-Man Cheung, Huisheng Wang, Antonio Ortega
EUROSYS
2011
ACM
13 years 2 months ago
Finding complex concurrency bugs in large multi-threaded applications
Parallel software is increasingly necessary to take advantage of multi-core architectures, but it is also prone to concurrency bugs which are particularly hard to avoid, find, an...
Pedro Fonseca, Cheng Li, Rodrigo Rodrigues
ICC
2008
IEEE
109views Communications» more  ICC 2008»
14 years 5 months ago
Wireless Scheduling Algorithms with O(1) Overhead for M-Hop Interference Model
Abstract—We develop a family of distributed wireless scheduling algorithms that requires only O(1) complexity for M-hop interference model, for any finite M. The recent technolo...
Yung Yi, Mung Chiang
GECCO
2005
Springer
113views Optimization» more  GECCO 2005»
14 years 4 months ago
A multi-objective algorithm for DS-CDMA code design based on the clonal selection principle
This paper proposes a new algorithm based on the clonal selection principle for the design of spreading codes for DS-CDMA. The algorithm follows a multi-objective approach, genera...
Daniel Stevens, Sanjoy Das, Balasubramaniam Natara...
TON
2010
125views more  TON 2010»
13 years 5 months ago
Computational analysis and efficient algorithms for micro and macro OFDMA downlink scheduling
OFDMA is one of the most important modulation and access methods for the future mobile networks. Before transmitting a frame on the downlink, an OFDMA base station has to invoke an...
Reuven Cohen, Liran Katzir