716 search results - page 48 / 144 » Algorithmic Issues in Coding Theory |
132
click to vote
SIGCOMM
2006
ACM
15 years 8 months ago
2006
ACM
Sensor networks are especially useful in catastrophic or emergency scenarios such as floods, fires, terrorist attacks or earthquakes where human participation may be too dangero...
124
Voted
CASES
2004
ACM
15 years 8 months ago
2004
ACM
This paper presents and reports on a VLIW code compression technique based on vector Hamming distances [19]. It investigates the appropriate selection of dictionary vectors such t...
AHS
2007
IEEE
15 years 4 months ago
2007
IEEE
This work describes an algebraic based design strategy targeting area optimization in reconfigurable computer technology (FPGA). Area optimization is a major issue as smaller comp...
110
click to vote
APPROX
2009
Springer
15 years 9 months ago
2009
Springer
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...
109
click to vote
ISCI
1998
15 years 2 months ago
1998
This paper presents a method for updating approximations of a concept incrementally. The results can be used to implement a quasi-incremental algorithm for learning classification...