Sciweavers

2621 search results - page 173 / 525
» Near orders and codes
Sort
View
STOC
1997
ACM
257views Algorithms» more  STOC 1997»
15 years 10 months ago
Practical Loss-Resilient Codes
We present randomized constructions of linear-time encodable and decodable codes that can transmit over lossy channels at rates extremely close to capacity. The encoding and decod...
Michael Luby, Michael Mitzenmacher, Mohammad Amin ...
CLEF
2009
Springer
15 years 7 months ago
Prior Art Search Using International Patent Classification Codes and All-Claims-Queries
In this study, we describe our system at the Intellectual Property track of the 2009 CrossLanguage Evaluation Forum campaign (CLEF-IP). The CLEF-IP track addressed prior art searc...
Benjamin Herbert, György Szarvas, Iryna Gurev...
RE
2010
Springer
15 years 1 months ago
Effort and Quality of Recovering Requirements-to-Code Traces: Two Exploratory Experiments
Trace links between requirements and code are essential for many software development and maintenance activities. Despite significant advances in traceability research, creating li...
Alexander Egyed, Florian Graf, Paul Grünbache...
ICIP
2004
IEEE
16 years 8 months ago
The seamlessly multiplexed embedded codec (SMEC) and its application in image coding
The landmark JPEG 2000 image compression standard offers not only superior compression performance, but also incredible flexibility. The compressed bitstream of JPEG 2000 can be f...
Jin Li
VLSID
2002
IEEE
142views VLSI» more  VLSID 2002»
16 years 7 months ago
Address Code and Arithmetic Optimizations for Embedded Systems
An important class of problems used widely in both the embedded systems and scientific domains perform memory intensive computations on large data sets. These data sets get to be ...
J. Ramanujam, Satish Krishnamurthy, Jinpyo Hong, M...