Sciweavers

1015 search results - page 175 / 203
» The data locality of work stealing
Sort
View
ICCV
2007
IEEE
14 years 10 months ago
High-Dimensional Feature Matching: Employing the Concept of Meaningful Nearest Neighbors
Matching of high-dimensional features using nearest neighbors search is an important part of image matching methods which are based on local invariant features. In this work we hi...
Dusan Omercevic, Ondrej Drbohlav, Ales Leonardis
SIGSOFT
2003
ACM
14 years 9 months ago
Tracking pointers with path and context sensitivity for bug detection in C programs
This paper proposes a pointer alias analysis for automatic error detection. State-of-the-art pointer alias analyses are either too slow or too imprecise for finding errors in real...
V. Benjamin Livshits, Monica S. Lam
SIGMOD
2009
ACM
157views Database» more  SIGMOD 2009»
14 years 8 months ago
Asynchronous view maintenance for VLSD databases
The query models of the recent generation of very large scale distributed (VLSD) shared-nothing data storage systems, including our own PNUTS and others (e.g. BigTable, Dynamo, Ca...
Parag Agrawal, Adam Silberstein, Brian F. Cooper, ...
SOSP
2005
ACM
14 years 5 months ago
BAR fault tolerance for cooperative services
This paper describes a general approach to constructing cooperative services that span multiple administrative domains. In such environments, protocols must tolerate both Byzantin...
Amitanand S. Aiyer, Lorenzo Alvisi, Allen Clement,...
CGO
2010
IEEE
14 years 3 months ago
Automatic creation of tile size selection models
Tiling is a widely used loop transformation for exposing/exploiting parallelism and data locality. Effective use of tiling requires selection and tuning of the tile sizes. This is...
Tomofumi Yuki, Lakshminarayanan Renganarayanan, Sa...