Sciweavers

204 search results - page 22 / 41
» Let's Evaluate Performance Algebraically
Sort
View
CORR
2008
Springer
97views Education» more  CORR 2008»
13 years 7 months ago
Lower bounds for adaptive linearity tests
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
Shachar Lovett
CCGRID
2010
IEEE
13 years 5 months ago
Dynamic Load-Balanced Multicast for Data-Intensive Applications on Clouds
Data-intensive parallel applications on clouds need to deploy large data sets from the cloud's storage facility to all compute nodes as fast as possible. Many multicast algori...
Tatsuhiro Chiba, Mathijs den Burger, Thilo Kielman...
PPOPP
2009
ACM
14 years 8 months ago
Transactional memory with strong atomicity using off-the-shelf memory protection hardware
This paper introduces a new way to provide strong atomicity in an implementation of transactional memory. Strong atomicity lets us offer clear semantics to programs, even if they ...
Martín Abadi, Tim Harris, Mojtaba Mehrara
WWW
2008
ACM
14 years 8 months ago
Application of bitmap index to information retrieval
To solve this problem, we devised the HS-bitmap index, which is hierarchically comprised of compressed data of summary bits. A summary bit in an upper matrix is obtained by logical...
Kengo Fujioka, Yukio Uematsu, Makoto Onizuka
SAC
2004
ACM
14 years 29 days ago
Integrating similarity-based queries in image DBMSs
Until recently, issues in image retrieval have been handled in DBMSs and in computer vision as separate research works. Nowadays, the trend is towards integrating the two approach...
Solomon Atnafu, Richard Chbeir, David Coquil, Lion...