Sciweavers

1039 search results - page 177 / 208
» Query reformulation with constraints
Sort
View
COLING
2010
14 years 6 months ago
Simple and Efficient Algorithm for Approximate Dictionary Matching
This paper presents a simple and efficient algorithm for approximate dictionary matching designed for similarity measures such as cosine, Dice, Jaccard, and overlap coefficients. ...
Naoaki Okazaki, Jun-ichi Tsujii
ECIR
2011
Springer
14 years 3 months ago
Video Retrieval Based on Words-of-Interest Selection
Query-by-example video retrieval is receiving an increasing attention in recent years. One of the state-of-art approaches is the Bag-of-visual Words (BoW) based technique, where im...
Lei Wang, Dawei Song, Eyad Elyan
PKDD
2005
Springer
129views Data Mining» more  PKDD 2005»
15 years 5 months ago
Interestingness is Not a Dichotomy: Introducing Softness in Constrained Pattern Mining
Abstract. The paradigm of pattern discovery based on constraints was introduced with the aim of providing to the user a tool to drive the discovery process towards potentially inte...
Stefano Bistarelli, Francesco Bonchi
STOC
2009
ACM
167views Algorithms» more  STOC 2009»
16 years 13 days ago
Universally utility-maximizing privacy mechanisms
A mechanism for releasing information about a statistical database with sensitive data must resolve a trade-off between utility and privacy. Publishing fully accurate information ...
Arpita Ghosh, Tim Roughgarden, Mukund Sundararajan
PODS
2008
ACM
174views Database» more  PODS 2008»
15 years 12 months ago
Epistemic privacy
We present a novel definition of privacy in the framework of offline (retroactive) database query auditing. Given information about the database, a description of sensitive data, ...
Alexandre V. Evfimievski, Ronald Fagin, David P. W...