248 search results - page 4 / 50 » Using structure indices for efficient approximation of netwo... |
CVPR
2004
IEEE
14 years 7 months ago
2004
IEEE
This paper introduces BoostMap, a method that can significantly reduce retrieval time in image and video database systems that employ computationally expensive distance measures, ...
SODA
2004
ACM
13 years 7 months ago
2004
ACM
We introduce the Bloomier filter, a data structure for compactly encoding a function with static support in order to support approximate evaluation queries. Our construction gener...
CN
2006
13 years 5 months ago
2006
Measurement studies indicate a high rate of node dynamics in p2p systems. In this paper, we address the question of how high a rate of node dynamics can be supported by structured...
AINA
2005
IEEE
13 years 11 months ago
2005
IEEE
2004, Chang et al. suggested an approach that solves the problem of secret sharing with access structures in a hierarchy. They used the concept of discrete logarithmto reuse shado...
ICDE
2009
IEEE
14 years 7 months ago
2009
IEEE
Abstract-- Answering approximate queries on string collections is important in applications such as data cleaning, query relaxation, and spell checking, where inconsistencies and e...