4075 search results - page 564 / 815 » Modeling Distributed Algorithm Using B |
175
click to vote
CCGRID
2007
IEEE
16 years 1 months ago
2007
IEEE
Data replication is an excellent technique to move and cache data close to users. By replication, data access performance can be improved dramatically. One of the challenges in da...
204
click to vote
AAECC
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We present new performance models and a new, more compact data structure for cache blocking when applied to the sparse matrixvector multiply (SpM×V) operation, y ← y +...
183
click to vote
ICIAP
1999
ACM
15 years 11 months ago
1999
ACM
ÐThis paper describes a novel framework for comparing and matching corrupted relational graphs. The paper develops the idea of edit-distance originally introduced for graph-matchi...
176
click to vote
WWW
2005
ACM
16 years 7 months ago
2005
ACM
We consider the problem of indexing high-dimensional data for answering (approximate) similarity-search queries. Similarity indexes prove to be important in a wide variety of sett...
180
click to vote
EUROSYS
2009
ACM
15 years 10 months ago
2009
ACM
Weakly consistent replication of data has become increasingly important both for loosely-coupled collections of personal devices and for large-scale infrastructure services. Unfor...