Sciweavers

338 search results - page 18 / 68
» Locally checkable proofs
Sort
View
ACTA
2006
108views more  ACTA 2006»
13 years 8 months ago
Refinement verification of the lazy caching algorithm
The lazy caching algorithm of Afek, Brown, and Merrit (1993) is a protocol that allows the use of local caches with delayed updates. It results in a memory model that is not atomi...
Wim H. Hesselink
LCPC
1993
Springer
14 years 5 hour ago
Maximizing Loop Parallelism and Improving Data Locality via Loop Fusion and Distribution
Abstract. Loop fusion is a program transformation that merges multiple loops into one. It is e ective for reducing the synchronization overhead of parallel loops and for improving ...
Ken Kennedy, Kathryn S. McKinley
DSD
2006
IEEE
114views Hardware» more  DSD 2006»
14 years 2 months ago
Improved Precision of Coarse Grained Localization in Wireless Sensor Networks
In wireless sensor networks, the coarse grained localization is a method to compute the position of randomly distributed sensor nodes. Without optimizations, it provides low preci...
Frank Reichenbach, Jan Blumenthal, Dirk Timmermann
MVA
2007
186views Computer Vision» more  MVA 2007»
13 years 9 months ago
Improving Rotation Invariance of the Volume Local Binary Pattern Operator
Dynamic texture is an extension of texture to the temporal domain. Recently, a powerful method for dynamic texture recognition based on volume local binary patterns (VLBP) was pro...
Guoying Zhao, Matti Pietikäinen
COMBINATORICS
2007
90views more  COMBINATORICS 2007»
13 years 8 months ago
Distinguishability of Locally Finite Trees
The distinguishing number ∆(X) of a graph X is the least positive integer n for which there exists a function f : V (X) → {0, 1, 2, · · · , n−1} such that no nonidentity ...
Mark E. Watkins, Xiangqian Zhou