Sciweavers

861 search results - page 140 / 173
» Symbolic Program Analysis Using Term Rewriting and Generaliz...
Sort
View
122
Voted
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
16 years 2 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
CIVR
2007
Springer
169views Image Analysis» more  CIVR 2007»
15 years 8 months ago
Whitened LDA for face recognition
Over the years, many Linear Discriminant Analysis (LDA) algorithms have been proposed for the study of high dimensional data in a large variety of problems. An intrinsic limitatio...
Vo Dinh Minh Nhat, Sungyoung Lee, Hee Yong Youn
CF
2006
ACM
15 years 4 months ago
Intermediately executed code is the key to find refactorings that improve temporal data locality
The growing speed gap between memory and processor makes an efficient use of the cache ever more important to reach high performance. One of the most important ways to improve cac...
Kristof Beyls, Erik H. D'Hollander
126
Voted
SAC
2009
ACM
15 years 9 months ago
Remote software protection by orthogonal client replacement
In a typical client-server scenario, a trusted server provides valuable services to a client, which runs remotely on an untrusted platform. Of the many security vulnerabilities th...
Mariano Ceccato, Paolo Tonella, Mila Dalla Preda, ...
KBSE
2005
IEEE
15 years 8 months ago
Empirical evaluation of the tarantula automatic fault-localization technique
The high cost of locating faults in programs has motivated the development of techniques that assist in fault localization by automating part of the process of searching for fault...
James A. Jones, Mary Jean Harrold