Sciweavers

215 search results - page 22 / 43
» The asymptotic number of binary codes and binary matroids
Sort
View
CASES
2005
ACM
15 years 1 months ago
A post-compilation register reassignment technique for improving hamming distance code compression
Code compression is a field where compression ratios between compiler-generated code and subsequent compressed code are highly dependent on decisions made at compile time. Most op...
Montserrat Ros, Peter Sutton
ECCC
2011
188views ECommerce» more  ECCC 2011»
14 years 6 months ago
Three Query Locally Decodable Codes with Higher Correctness Require Exponential Length
Locally decodable codes are error correcting codes with the extra property that, in order to retrieve the correct value of just one position of the input with high probability, it...
Anna Gál, Andrew Mills
AVSS
2006
IEEE
15 years 5 months ago
Large System Decision Fusion Performance in Inhomogeneous Sensor Networks
The problem of decision fusion in a large wireless sensor system with many power-constrained distributed nodes is considered. The sensor network is assumed to be inhomogeneous. i....
Sudharman K. Jayaweera, Kossai Al-Tarazi
TSP
2011
144views more  TSP 2011»
14 years 6 months ago
On Decentralized Detection With Partial Information Sharing Among Sensors
—We study a decentralized detection architecture in which each of a set of sensors transmits a highly compressed summary of its observations (a binary message) to a fusion center...
O. Patrick Kreidl, John N. Tsitsiklis, Spyros I. Z...
EUROGP
2000
Springer
107views Optimization» more  EUROGP 2000»
15 years 3 months ago
Using Factorial Experiments to Evaluate the Effect of Genetic Programming Parameters
Abstract. Statistical techniques for designing and analysing experiments are used to evaluate the individual and combined effects of genetic programming parameters. Three binary cl...
Robert Feldt, Peter Nordin