Sciweavers

634 search results - page 34 / 127
» Fast Evaluation Techniques for Complex Similarity Queries
Sort
View
SACRYPT
2007
Springer
151views Cryptology» more  SACRYPT 2007»
14 years 2 months ago
Collisions for 70-Step SHA-1: On the Full Cost of Collision Search
The diversity of methods for fast collision search in SHA-1 and similar hash functions makes a comparison of them difficult. The literature is at times very vague on this issue, wh...
Christophe De Cannière, Florian Mendel, Chr...
VLDB
2007
ACM
107views Database» more  VLDB 2007»
14 years 8 months ago
VGRAM: Improving Performance of Approximate Queries on String Collections Using Variable-Length Grams
Many applications need to solve the following problem of approximate string matching: from a collection of strings, how to find those similar to a given string, or the strings in ...
Chen Li, Bin Wang, Xiaochun Yang
KDD
2004
ACM
139views Data Mining» more  KDD 2004»
14 years 8 months ago
Machine learning for online query relaxation
In this paper we provide a fast, data-driven solution to the failing query problem: given a query that returns an empty answer, how can one relax the query's constraints so t...
Ion Muslea
ICDE
1995
IEEE
164views Database» more  ICDE 1995»
14 years 9 months ago
Efficient Processing of Nested Fuzzy SQL Queries
?In a fuzzy relational database where a relation is a fuzzy set of tuples and ill-known data are represented by possibility distributions, nested fuzzy queries can be expressed in ...
Qi Yang, Chengwen Liu, Jing Wu, Clement T. Yu, Son...
TIME
2009
IEEE
14 years 2 months ago
Preserving Anonymity of Recurrent Location-Based Queries
—The anonymization of location based queries through the generalization of spatio-temporal information has been proposed as a privacy preserving technique. We show that the prese...
Daniele Riboni, Linda Pareschi, Claudio Bettini, S...