Sciweavers

314 search results - page 18 / 63
» A Comparison of Known Codes, Random Codes, and the Best Code...
Sort
View
STOC
2012
ACM
201views Algorithms» more  STOC 2012»
11 years 11 months ago
From irreducible representations to locally decodable codes
Locally Decodable Code (LDC) is a code that encodes a message in a way that one can decode any particular symbol of the message by reading only a constant number of locations, eve...
Klim Efremenko
ESA
2004
Springer
96views Algorithms» more  ESA 2004»
14 years 2 months ago
An Experimental Study of Random Knapsack Problems
The size of the Pareto curve for the bicriteria version of the knapsack problem is polynomial on average. This has been shown for various random input distributions. We experimenta...
René Beier, Berthold Vöcking
DAC
2001
ACM
14 years 9 months ago
A2BC: Adaptive Address Bus Coding for Low Power Deep Sub-Micron Designs
Due to larger buses (length, width) and deep sub-micron effects where coupling capacitances between bus lines are in the same order of magnitude as base capacitances, power consum...
Haris Lekatsas, Jörg Henkel
MCS
2009
Springer
14 years 3 months ago
Recoding Error-Correcting Output Codes
Abstract. One of the most widely applied techniques to deal with multiclass categorization problems is the pairwise voting procedure. Recently, this classical approach has been emb...
Sergio Escalera, Oriol Pujol, Petia Radeva
MSWIM
2009
ACM
14 years 3 months ago
HUBCODE: message forwarding using hub-based network coding in delay tolerant networks
Most people-centric delay tolerant networks have been shown to exhibit power-law behavior. Analysis of the temporal connectivity graph of such networks reveals the existence of hu...
Shabbir Ahmed, Salil S. Kanhere