Sciweavers

122 search results - page 8 / 25
» The First Report on Scheme Revisited
Sort
View
TCC
2009
Springer
130views Cryptology» more  TCC 2009»
14 years 9 months ago
How Efficient Can Memory Checking Be?
We consider the problem of memory checking, where a user wants to maintain a large database on a remote server but has only limited local storage. The user wants to use the small ...
Cynthia Dwork, Moni Naor, Guy N. Rothblum, Vinod V...
AINA
2010
IEEE
14 years 1 months ago
A Fully Dynamic and Self-Stabilizing TDMA Scheme for Wireless Ad-hoc Networks
One important challenge in wireless ad hoc networks is to achieve collision free communication. Many MAC layer protocols have been proposed by considering various communication mod...
Bezawada Bruhadeshwar, Kishore Kothapalli, Indira ...
MTA
1998
119views more  MTA 1998»
13 years 8 months ago
A New Indexing Scheme for Content-Based Image Retrieval
We propose a new efficient indexing scheme, called the HG-tree, to support content-based retrieval in image databases. Image content is represented by a point in a multidimensional...
Guang-Ho Cha, Chin-Wan Chung
TC
2010
13 years 7 months ago
Redundant-Digit Floating-Point Addition Scheme Based on a Stored Rounding Value
—Due to the widespread use and inherent complexity of floating-point addition, much effort has been devoted to its speedup via algorithmic and circuit techniques. We propose a ne...
Ghassem Jaberipur, Behrooz Parhami, Saeid Gorgin
HPCA
2000
IEEE
14 years 1 months ago
Coherence Communication Prediction in Shared-Memory Multiprocessors
Abstract—Sharing patterns in shared-memory multiprocessors are the key to performance: uniprocessor latencytolerating techniques such as out-of-order execution and non-blocking c...
Stefanos Kaxiras, Cliff Young