Sciweavers

1477 search results - page 230 / 296
» Complexity of (iterated) dominance
Sort
View
MOBIHOC
2008
ACM
14 years 8 months ago
Optimal relay assignment for cooperative communications
Recently, cooperative communications, in the form of keeping each node with a single antenna and having a node exploit a relay node's antenna, is shown to be a promising appr...
Yi Shi, Sushant Sharma, Y. Thomas Hou, Sastry Komp...
DCC
2004
IEEE
14 years 8 months ago
On Some New Approaches to Practical Slepian-Wolf Compression Inspired by Channel Coding
We introduce three new innovations for compression using LDPCs for the Slepian-Wolf problem. The first is a general iterative Slepian-Wolf decoding algorithm that incorporates the...
Anna H. Lee, Michelle Effros, Muriel Médard...
SDM
2009
SIAM
193views Data Mining» more  SDM 2009»
14 years 6 months ago
Agglomerative Mean-Shift Clustering via Query Set Compression.
Mean-Shift (MS) is a powerful non-parametric clustering method. Although good accuracy can be achieved, its computational cost is particularly expensive even on moderate data sets...
Xiaotong Yuan, Bao-Gang Hu, Ran He
ALT
2002
Springer
14 years 5 months ago
Optimally-Smooth Adaptive Boosting and Application to Agnostic Learning
We describe a new boosting algorithm that is the first such algorithm to be both smooth and adaptive. These two features make possible performance improvements for many learning ...
Dmitry Gavinsky
ICCAD
2006
IEEE
125views Hardware» more  ICCAD 2006»
14 years 5 months ago
Leveraging protocol knowledge in slack matching
Stalls, due to mis-matches in communication rates, are a major performance obstacle in pipelined circuits. If the rate of data production is faster than the rate of consumption, t...
Girish Venkataramani, Seth Copen Goldstein