Sciweavers

1169 search results - page 170 / 234
» Degrees of monotone complexity
Sort
View
AOSD
2007
ACM
14 years 2 months ago
Efficiently mining crosscutting concerns through random walks
Inspired by our past manual aspect mining experiences, this paper describes a random walk model to approximate how crosscutting concerns can be discovered in the absence of domain...
Charles Zhang, Hans-Arno Jacobsen
APGV
2007
ACM
131views Visualization» more  APGV 2007»
14 years 2 months ago
Is accurate occlusion of glossy reflections necessary?
Much research in recent times has been conducted towards realtime rendering of accurate glossy reflections under direct, natural illumination including correct occlusions. The vie...
Oscar Kozlowski, Jan Kautz
PODC
2010
ACM
14 years 1 months ago
Verifying linearizability with hindsight
We present a proof of safety and linearizability of a highlyconcurrent optimistic set algorithm. The key step in our proof is the Hindsight Lemma, which allows a thread to infer t...
Peter W. O'Hearn, Noam Rinetzky, Martin T. Vechev,...
HPCC
2007
Springer
14 years 1 months ago
An Exploration of Performance Attributes for Symbolic Modeling of Emerging Processing Devices
Vector, emerging (homogenous and heterogeneous) multi-core and a number of accelerator processing devices potentially offer an order of magnitude speedup for scientific application...
Sadaf R. Alam, Nikhil Bhatia, Jeffrey S. Vetter
ACSD
2004
IEEE
124views Hardware» more  ACSD 2004»
14 years 1 months ago
A Behavioral Type Inference System for Compositional System-on-Chip Design
The design productivity gap has been recognized by the semiconductor industry as one of the major threats to the continued growth of system-on-chips and embedded systems. Ad-hoc s...
Jean-Pierre Talpin, David Berner, Sandeep K. Shukl...