Results 81 to 90 of about 6,986 (292)
DEANN:Speeding up Kernel-Density Estimation using Approximate Nearest Neighbor Search
, 2022 Kernel Density Estimation (KDE) is a nonparametric method for estimatig the shape of a density function, given a set of samples from the distribution. Recently, locality-sensitive hashing, originally proposed as a tool for nearest neighbor search, has ...
Pagh, Rasmus +2 more
core
Advanced Functional Materials, EarlyView.A swelling‐programmed micropatterned hydrogel guides adherent cells through a controlled transition from cell–matrix anchoring to cadherin‐mediated cell–cell compaction, enabling rapid assembly of high‐viability spheroids with defined size and morphology.
Han Gyeol Nam +8 more
wiley +1 more source
Approximate Nearest Neighbor Search in ℓp.
CoRR, 2013 We present a new locality sensitive hashing (LSH) algorithm for $c$-approximate nearest neighbor search in $\ell_p$ with ...
openaire +3 more sources
Query-Adaptive Reciprocal Hash Tables for Nearest Neighbor Search
, 2016 Recent years have witnessed the success of binary hashing techniques in approximate nearest neighbor search. In practice, multiple hash tables are usually built using hashing to cover more desired results in the hit buckets of each table.
Liu, X +9 more
core +1 more source
Solvent Co‐Intercalation Enabled Ca Storage in MoS2 for Ca‐Ion Batteries
Advanced Functional Materials, EarlyView.Regulating electrolyte solvation levels enables otherwise non‐intercalatable Ca2+ ions to reversibly co‐intercalate into molybdenum disulfide (MoS2) as ether‐solvated species. The intercalation reversibility is strongly governed by solvent chain length, as demonstrated using diethylene glycol dimethyl ether (G2) and tetraethylene glycol dimethyl ether (
Yudong Luo +10 more
wiley +1 more source
Recent Approaches and Trends in Approximate Nearest Neighbor Search
, 2023 Nearest neighbor search is a computational primitive whose efficiency is paramount to many applications. As such, the literature recently blossomed with many works focusing on improving its effectiveness in an approximate setting. In this overview paper,
Ceccarello, Matteo +1 more
core +1 more source
Song Intersection by Approximate Nearest Neighbor Search
, 2008 We present new methods for computing inter-song similarities using intersections between multiple audio pieces. The intersection contains portions that are similar, when one song is a derivative work of the other for example, in two different musical ...
core
Efficient Similarity Search in Structured Data [PDF]
, 2004 Modern database applications are characterized by two major aspects: the use of complex data types with internal structure and the need for new data analysis methods.
Schönauer, Stefan
core
Joint K-Means quantization for Approximate Nearest Neighbor Search
, 2016 Recently, Approximate Nearest Neighbor (ANN) Search has become a very popular approach for similarity search on large-scale datasets. In this paper, we propose a novel vector quantization method for ANN, which introduces a joint multi-layer K-Means ...
Moncef Gabbouj +5 more
core +1 more source
, 2023 Recently, complicated spatial search algorithms have emerged as spatial-information-based applications, such as location-based services (LBS), and have become very diverse and frequent.
Jaejun Yoo +2 more
core +1 more source