Sciweavers

5752 search results - page 506 / 1151
» Informative Labeling Schemes
Sort
View
IWVF
2001
Springer
15 years 12 months ago
Minimum-Length Polygons in Approximation Sausages
The paper introduces a new approximation scheme for planar digital curves. This scheme defines an approximating sausage ‘around’ the given digital curve, and calculates a mini...
Tetsuo Asano, Yasuyuki Kawamura, Reinhard Klette, ...
WEBDB
2001
Springer
113views Database» more  WEBDB 2001»
15 years 12 months ago
Indexing XML Data with ToXin
Indexing schemes for semistructured data have been developed in recent years to optimize path query processing by summarizing path information. However, most of these schemes can ...
Flavio Rizzolo, Alberto O. Mendelzon
CRYPTO
1999
Springer
109views Cryptology» more  CRYPTO 1999»
15 years 11 months ago
Coding Constructions for Blacklisting Problems without Computational Assumptions
Abstract. We consider the broadcast exclusion problem: how to transmit a message over a broadcast channel shared by N = 2n users so that all but some specified coalition of k excl...
Ravi Kumar, Sridhar Rajagopalan, Amit Sahai
EUROCRYPT
1999
Springer
15 years 11 months ago
A Note on the Limits of Collusion-Resistant Watermarks
In one proposed use of digital watermarks, the owner of a document D sells slightly different documents, D1 , D2 , . . . to each buyer; if a buyer posts his/her document Di to the...
Funda Ergün, Joe Kilian, Ravi Kumar
HPCA
1998
IEEE
15 years 11 months ago
Hardware for Speculative Run-Time Parallelization in Distributed Shared-Memory Multiprocessors
Run-time parallelization is often the only way to execute the code in parallel when data dependence information is incomplete at compile time. This situation is common in many imp...
Ye Zhang, Lawrence Rauchwerger, Josep Torrellas