Sciweavers

4463 search results - page 875 / 893
» computing 2000
Sort
View
CPM
2000
Springer
177views Combinatorics» more  CPM 2000»
15 years 10 months ago
Identifying and Filtering Near-Duplicate Documents
Abstract. The mathematical concept of document resemblance captures well the informal notion of syntactic similarity. The resemblance can be estimated using a fixed size “sketch...
Andrei Z. Broder
CPM
2000
Springer
160views Combinatorics» more  CPM 2000»
15 years 10 months ago
Approximation Algorithms for Hamming Clustering Problems
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
Leszek Gasieniec, Jesper Jansson, Andrzej Lingas
CRYPTO
2000
Springer
149views Cryptology» more  CRYPTO 2000»
15 years 10 months ago
A Cryptographic Solution to a Game Theoretic Problem
In this work we use cryptography to solve a game-theoretic problem which arises naturally in the area of two party strategic games. The standard game-theoretic solution concept for...
Yevgeniy Dodis, Shai Halevi, Tal Rabin
CRYPTO
2000
Springer
133views Cryptology» more  CRYPTO 2000»
15 years 10 months ago
Sequential Traitor Tracing
Traceability schemes allow detection of at least one traitor when a group of colluders attempt to construct a pirate decoder and gain illegal access to digital content. Fiat and Ta...
Reihaneh Safavi-Naini, Yejing Wang
DDEP
2000
Springer
15 years 10 months ago
Context-Aware Digital Documents Described in a High-Level Petri Net-Based Hypermedia System
As mobile computing becomes widespread, so will the need for digital document delivery by hypertextual means. A further trend will be the provision of the ability for devices to de...
Jin-Cheon Na, Richard Furuta