Sciweavers

68 search results - page 7 / 14
» cc 2010
Sort
View
CC
2010
Springer
120views System Software» more  CC 2010»
13 years 4 months ago
Lower Bounds for Agnostic Learning via Approximate Rank
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose that t...
Adam R. Klivans, Alexander A. Sherstov
CC
2010
Springer
117views System Software» more  CC 2010»
14 years 2 months ago
Punctual Coalescing
Compilers use register coalescing to avoid generating code for copy instructions. For architectures with register aliasing such as x86, Smith, Ramsey, and Holloway (2004) presented...
Fernando Magno Quintão Pereira, Jens Palsbe...
CC
2010
Springer
118views System Software» more  CC 2010»
13 years 5 months ago
Unrestricted Code Motion: A Program Representation and Transformation Algorithms Based on Future Values
Abstract. We introduce the concept of future values. Using future values it is possible to represent programs in a new control-flow form such that on any control flow path the data...
Shuhan Ding, Soner Önder
ESEM
2010
ACM
13 years 8 months ago
Effects of the number of developers on code quality in open source software: a case study
Eleven open source software projects written in C/C++ were analyzed to determine if the number of committing developers impacts code quality. We use cyclomatic complexity, lines o...
Brandon Norick, Justin Krohn, Eben Howard, Ben Wel...
PODC
2010
ACM
13 years 11 months ago
Group mutual exclusion in O(log n) RMR
We present an algorithm to solve the GROUP MUTUAL EXCLUSION problem in the cache-coherent (CC) model. For the same problem in the distributed shared memory (DSM) model, Danek and ...
Vibhor Bhatt, Chien-Chung Huang