Sciweavers

1284 search results - page 147 / 257
» Data Structures for Mergeable Trees
Sort
View
EDBT
2010
ACM
138views Database» more  EDBT 2010»
15 years 7 months ago
How to authenticate graphs without leaking
Secure data sharing in multi-party environments requires that both authenticity and confidentiality of the data be assured. Digital signature schemes are commonly employed for au...
Ashish Kundu, Elisa Bertino
FOCS
2009
IEEE
15 years 6 months ago
Space-Efficient Framework for Top-k String Retrieval Problems
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...
Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter
EXTREME
2004
ACM
15 years 8 months ago
Half-steps toward LMNL
Overlap in markup occurs where some markup structures do not nest, such as where the sentence and phrase boundaries of a poem and the metrical line structure describe different hi...
Wendell Piez
210
Voted
ASPLOS
2011
ACM
14 years 6 months ago
NV-Heaps: making persistent objects fast and safe with next-generation, non-volatile memories
nt, user-defined objects present an attractive abstraction for working with non-volatile program state. However, the slow speed of persistent storage (i.e., disk) has restricted ...
Joel Coburn, Adrian M. Caulfield, Ameen Akel, Laur...
SC
1991
ACM
15 years 6 months ago
A method of vector processing for shared symbolic data
Kanada, Y., A method of vector processing for shared symbolic data, Parallel Computing, X (1993) XXX-XXX. Conventional processing techniques for pipelined vector processors such a...
Yasusi Kanada