Sciweavers

249 search results - page 15 / 50
» Characterization Results for Time-Varying Codes
Sort
View
CSMR
2005
IEEE
14 years 1 months ago
Correlating Features and Code Using a Compact Two-Sided Trace Analysis Approach
Software developers are constantly required to modify and adapt application features in response to changing requirements. The problem is that just by reading the source code, it ...
Orla Greevy, Stéphane Ducasse
AAAI
2011
12 years 7 months ago
Convex Sparse Coding, Subspace Learning, and Semi-Supervised Extensions
Automated feature discovery is a fundamental problem in machine learning. Although classical feature discovery methods do not guarantee optimal solutions in general, it has been r...
Xinhua Zhang, Yaoliang Yu, Martha White, Ruitong H...
ICALP
2007
Springer
14 years 2 months ago
Reconciling Data Compression and Kolmogorov Complexity
While data compression and Kolmogorov complexity are both about effective coding of words, the two settings differ in the following respect. A compression algorithm or compressor...
Laurent Bienvenu, Wolfgang Merkle
APPROX
2009
Springer
136views Algorithms» more  APPROX 2009»
14 years 2 months ago
Succinct Representation of Codes with Applications to Testing
Motivated by questions in property testing, we search for linear error-correcting codes that have the “single local orbit” property: i.e., they are specified by a single loca...
Elena Grigorescu, Tali Kaufman, Madhu Sudan
ESEC
1993
Springer
13 years 12 months ago
Software Faults in Evolving a Large, Real-Time System: a Case Study
We report the results of a survey about the software faults encountered during the testing phases in evolving a large real-time system. The survey was done in two parts: the rst pa...
Dewayne E. Perry, Carol S. Stieg