Sciweavers

2621 search results - page 137 / 525
» Near orders and codes
Sort
View
STOC
1994
ACM
134views Algorithms» more  STOC 1994»
15 years 10 months ago
A coding theorem for distributed computation
Shannon's Coding Theorem shows that in order to reliably transmit a message of T bits over a noisy communication channel, only a constant slowdown factor is necessary in the ...
Sridhar Rajagopalan, Leonard J. Schulman
NLDB
2010
Springer
15 years 10 months ago
Automatic Quality Assessment of Source Code Comments: The JavadocMiner
Abstract. An important software engineering artefact used by developers and maintainers to assist in software comprehension and maintenance is source code documentation. It provide...
Ninus Khamis, René Witte, Juergen Rilling
APSEC
2005
IEEE
15 years 8 months ago
Increasing the Efficiency of Fault Detection in Modified Code
Many software systems are developed in a number of consecutive releases. Each new release does not only add new code but also modifies already existing one. In this study we have ...
Piotr Tomaszewski, Lars Lundberg, Håkan Grah...
NIPS
2008
15 years 7 months ago
Dynamic visual attention: searching for coding length increments
A visual attention system should respond placidly when common stimuli are presented, while at the same time keep alert to anomalous visual inputs. In this paper, a dynamic visual ...
Xiaodi Hou, Liqing Zhang
CORR
2008
Springer
129views Education» more  CORR 2008»
15 years 6 months ago
Combining Beamforming and Space-Time Coding Using Noisy Quantized Feedback
The goal of combining beamforming and space-time coding is to obtain full-diversity order and to provide additional received power (array gain) compared to conventional space-time...
Siavash Ekbatani, Hamid Jafarkhani