Sciweavers

1245 search results - page 140 / 249
» Binary Sparse Coding
Sort
View
ICSM
2005
IEEE
15 years 9 months ago
Dynamic Feature Traces: Finding Features in Unfamiliar Code
This paper introduces an automated technique for feature location: helping developers map features to relevant source code. Like several other automated feature location technique...
Andrew David Eisenberg, Kris De Volder
133
Voted
WCRE
2000
IEEE
15 years 7 months ago
Towards Portable Source Code Representations using XML
One of the most important issue in source code analysis and software re-engineering is the representation of ode text at an abstraction level and form suitable for algorithmic pro...
Evan Mamas, Kostas Kontogiannis
STOC
1994
ACM
134views Algorithms» more  STOC 1994»
15 years 7 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
134
Voted
CORR
2008
Springer
129views Education» more  CORR 2008»
15 years 3 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
AIR
1998
103views more  AIR 1998»
15 years 3 months ago
Tackling Real-Coded Genetic Algorithms: Operators and Tools for Behavioural Analysis
Abstract. Genetic algorithms play a significant role, as search techniques for handling complex spaces, in many fields such as artificial intelligence, engineering, robotic, etc...
Francisco Herrera, Manuel Lozano, José L. V...