10419 search results - page 1999 / 2084 » Relational information gain |
208
Voted
ERCIMDL
2001
Springer
15 years 10 months ago
2001
Springer
This paper proposes an approach to the problem of generating metadata for composite mixed-media digital objects by appropriately combining and exploiting existing knowledge or met...
174
Voted
EUROCRYPT
2001
Springer
15 years 10 months ago
2001
Springer
We formalize the notion of a cryptographic counter, which allows a group of participants to increment and decrement a cryptographic representation of a (hidden) numerical value pri...
209
click to vote
ICALP
2001
Springer
15 years 10 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
178
click to vote
LPAR
2001
Springer
15 years 10 months ago
2001
Springer
Several logic-based languages, such as Prolog II and its successors, SICStus Prolog and Oz, offer a computation domain including rational trees. Infinite rational trees allow fo...
162
click to vote
FOCS
2000
IEEE
15 years 10 months ago
2000
IEEE
There is an upsurging interest in designing succinct data structures for basic searching problems (see [23] and references therein). The motivation has to be found in the exponent...