Sciweavers

365 search results - page 2 / 73
» Achieving accurate and context-sensitive timing for code opt...
Sort
View
TIT
2008
110views more  TIT 2008»
14 years 11 months ago
Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
We present error-correcting codes that achieve the information-theoretically best possible trade-off between the rate and error-correction radius. Specifically, for every 0 < R...
Venkatesan Guruswami, Atri Rudra
KDD
2004
ACM
150views Data Mining» more  KDD 2004»
16 years 2 days ago
Complete This Puzzle: A Connectionist Approach to Accurate Web Recommendations Based on a Committee of Predictors
Abstract. We present a Context Ultra-Sensitive Approach based on two-step Recommender systems (CUSA-2step-Rec). Our approach relies on a committee of profile-specific neural networ...
Olfa Nasraoui, Mrudula Pavuluri
ICC
2007
IEEE
110views Communications» more  ICC 2007»
15 years 6 months ago
A New STC Structure to Achieve Generalized Optimal Diversity with a Reduced Design Complexity
Abstract - We propose a new space-time code (STC) structure that can achieve generalized optimal diversity (GOD) with a reduced design complexity, and also provide an increased cod...
Moon Il Lee, Seong Keun Oh, Dong Seung Kwon
CORR
2006
Springer
97views Education» more  CORR 2006»
14 years 11 months ago
Explicit Space-Time Codes Achieving The Diversity-Multiplexing Gain Tradeoff
A recent result of Zheng and Tse states that over a quasi-static channel, there exists a fundamental tradeoff, referred to as the diversity-multiplexing gain (D-MG) tradeoff, betwe...
Petros Elia, K. Raj Kumar, Sameer A. Pawar, P. Vij...
INFOCOM
2005
IEEE
15 years 5 months ago
On achieving optimal throughput with network coding
— With the constraints of network topologies and link capacities, achieving the optimal end-to-end throughput in data networks has been known as a fundamental but computationally...
Zongpeng Li, Baochun Li, Dan Jiang, Lap Chi Lau