Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleMay 2022
Proximity Searchable Encryption for the Iris Biometric
ASIA CCS '22: Proceedings of the 2022 ACM on Asia Conference on Computer and Communications SecurityMay 2022, Pages 1004–1018https://doi.org/10.1145/3488932.3497754Biometric databases collect people's information and allow users to perform proximity searches (finding all records within a bounded distance of the query point) with few cryptographic protections. This work studies proximity searchable encryption ...
- research-articleJune 2019
New polynomial delay bounds for maximal subgraph enumeration by proximity search
STOC 2019: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of ComputingJune 2019, Pages 1179–1190https://doi.org/10.1145/3313276.3316402In this paper we propose polynomial delay algorithms for several maximal subgraph listing problems, by means of a seemingly novel technique which we call proximity search. Our result involves modeling the space of solutions as an implicit directed graph ...
- research-articleJanuary 2015
Approximating Minimization Diagrams and Generalized Proximity Search
SIAM Journal on Computing (SICOMP), Volume 44, Issue 42015, Pages 944–974https://doi.org/10.1137/140959067We investigate the classes of functions whose minimization diagrams can be approximated efficiently in $\mathbb{R}^d$. We present a general framework and a data-structure that can be used to approximate the minimization diagram of such functions. The ...
- research-articleJune 2014
Fast and unified local search for random walk based k-nearest-neighbor query in large graphs
SIGMOD '14: Proceedings of the 2014 ACM SIGMOD International Conference on Management of DataJune 2014, Pages 1139–1150https://doi.org/10.1145/2588555.2610500Given a large graph and a query node, finding its k-nearest-neighbor (kNN) is a fundamental problem. Various random walk based measures have been developed to measure the proximity (similarity) between nodes. Existing algorithms for the random walk ...
- research-articleJanuary 2014
Down the Rabbit Hole: Robust Proximity Search and Density Estimation in Sublinear Space
SIAM Journal on Computing (SICOMP), Volume 43, Issue 42014, Pages 1486–1511https://doi.org/10.1137/130916448For a set of $n$ points in $\mathbb{R}^d$, and parameters $k$ and $\varepsilon$, we present a data structure that answers $(1+\varepsilon,k)$ approximate nearest neighbor queries in logarithmic time. Surprisingly, the space used by the data structure is $\...
-
- ArticleOctober 2013
Approximating Minimization Diagrams and Generalized Proximity Search
FOCS '13: Proceedings of the 2013 IEEE 54th Annual Symposium on Foundations of Computer ScienceOctober 2013, Pages 717–726https://doi.org/10.1109/FOCS.2013.82We investigate the classes of functions whose minimization diagrams can be approximated efficiently in Red. We present a general framework and a data-structure that can be used to approximate the minimization diagram of such functions. The resulting ...
- abstractMay 2013
A proximity-based fallback model for hybrid web recommender systems
WWW '13 Companion: Proceedings of the 22nd International Conference on World Wide WebMay 2013, Pages 389–394https://doi.org/10.1145/2487788.2487948Although there are numerous websites that provide recommendation services for various items such as movies, music, and books, most of studies on recommender systems only focus on one specific item type. As recommender sites expand to cover several types ...
- research-articleOctober 2012
Density index and proximity search in large graphs
CIKM '12: Proceedings of the 21st ACM international conference on Information and knowledge managementOctober 2012, Pages 235–244https://doi.org/10.1145/2396761.2396794Given a large real-world graph where vertices are associated with labels, how do we quickly find interesting vertex sets according to a given query? In this paper, we study label-based proximity search in large graphs, which finds the top-k query-...
- ArticleApril 2008
Counting Distance Permutations
SISAP '08: Proceedings of the First International Workshop on Similarity Search and Applications (sisap 2008)April 2008, Pages 69–76https://doi.org/10.1109/SISAP.2008.15A distance permutation index supports fast proximity searching in a high-dimensional metric space. Given some fixed reference sites, for each point in a database the index stores a permutation naming the closest site, the second-closest, and so on. We ...
- research-articleFebruary 2008
Disorder inequality: a combinatorial approach to nearest neighbor search
WSDM '08: Proceedings of the 2008 International Conference on Web Search and Data MiningFebruary 2008, Pages 25–32https://doi.org/10.1145/1341531.1341538We say that an algorithm for nearest neighbor search is combinatorial if only direct comparisons between two pairwise similarity values are allowed. Combinatorial algorithms for nearest neighbor search have two important advantages: (1) they do not map ...
- research-articleNovember 2007
Evaluation of phrasal query suggestions
CIKM '07: Proceedings of the sixteenth ACM conference on Conference on information and knowledge managementNovember 2007, Pages 841–848https://doi.org/10.1145/1321440.1321556This paper evaluates the uptake and efficacy of a unified approach to phrasal query suggestions in the context of a high-precision search engine. The search engine performs ranked extended-Boolean searches with the proximity operator <scp>NEAR</scp> ...
- articleJuly 2005
A novel document retrieval method using the discrete wavelet transform
ACM Transactions on Information Systems (TOIS), Volume 23, Issue 3Pages 267–298https://doi.org/10.1145/1080343.1080345Current information retrieval methods either ignore the term positions or deal with exact term positions; the former can be seen as coarse document resolution, the latter as fine document resolution. We propose a new spectral-based information retrieval ...
- ArticleNovember 1999
Text Retrieval by Using k-word Proximity Search
DANTE '99: Proceedings of the 1999 International Symposium on Database Applications in Non-Traditional EnvironmentsNovember 1999, Page 183When we search from a huge amount of documents, we often specify several keywords and use conjunctive queries to narrow the result of the search. Though the searched documents contain all keywords, positions of the keywords are usually not considered. ...
- ArticleSeptember 1999
Searching in Metric Spaces by Spatial Approximation
SPIRE '99: Proceedings of the String Processing and Information Retrieval Symposium & International Workshop on GroupwareSeptember 1999, Page 141We propose a new data structure to search in metric spaces. A metric space is formed by a collection of objects and a distance function defined among them, which satisfies the triangular inequality. The goal is, given a set of objects and a query, ...
- ArticleJuly 1998
Efficient Proximity Search in Multivariate Data
SSDBM '98: Proceedings of the 10th International Conference on Scientific and Statistical Database ManagementJuly 1998, Pages 145–154Proximity search is an important type of database query which is essential to many practical applications involving various types of metric data, including multivariate data with distance function. Point spatial data is a popular subset of metric data ...