Sciweavers

1757 search results - page 292 / 352
» Alternating Refinement Relations
Sort
View
SIGMETRICS
2000
ACM
177views Hardware» more  SIGMETRICS 2000»
15 years 5 months ago
A case for end system multicast
— The conventional wisdom has been that IP is the natural protocol layer for implementing multicast related functionality. However, more than a decade after its initial proposal,...
Yang-Hua Chu, Sanjay G. Rao, Hui Zhang
107
Voted
VLDB
2000
ACM
155views Database» more  VLDB 2000»
15 years 4 months ago
ICICLES: Self-Tuning Samples for Approximate Query Answering
Approximate query answering systems provide very fast alternatives to OLAP systems when applications are tolerant to small errors in query answers. Current sampling-based approach...
Venkatesh Ganti, Mong-Li Lee, Raghu Ramakrishnan
HT
1987
ACM
15 years 4 months ago
Exploring Representation Problems Using Hypertext
Hypertext is a technology well-suited to exploring different kinds of representational problems. It can be used first as an informal mechanism to describe the attributes of object...
Catherine C. Marshall
94
Voted
VLDB
1987
ACM
90views Database» more  VLDB 1987»
15 years 4 months ago
Index Access with a Finite Buffer
: A buffer is a main-memory area used to reduce accessto disks. The buffer holds pages from secondary storage files. A processrequesting a page causesa fault if the pageis not in t...
Giovanni Maria Sacco
108
Voted
PKC
2010
Springer
126views Cryptology» more  PKC 2010»
15 years 2 months ago
Implicit Factoring with Shared Most Significant and Middle Bits
We study the problem of integer factoring given implicit information of a special kind. The problem is as follows: let N1 = p1q1 and N2 = p2q2 be two RSA moduli of same bit-size, w...
Jean-Charles Faugère, Raphaël Marinier...