Search Results for author:
Found 7 papers, 4 papers with code
Approximate Nearest Neighbor Search with Window Filters
We define and investigate the problem of $\textit{c-approximate window search}$: approximate nearest neighbor search where each point in the dataset has a numeric label, and the goal is to find nearest neighbors to queries within arbitrary label ranges.
PECANN: Parallel Efficient Clustering with Graph-Based Approximate Nearest Neighbor Search
In particular, we study variants of density peaks clustering, a popular type of algorithm that has been shown to work well in practice.
AuthentiGPT: Detecting Machine-Generated Text via Black-Box Language Models Denoising
Under the assumption that human-written text resides outside the distribution of machine-generated text, AuthentiGPT leverages a black-box LLM to denoise input text with artificially added noise, and then semantically compares the denoised text with the original to determine if the content is machine-generated.
Improving Small Language Models on PubMedQA via Generative Data Augmentation
Large Language Models (LLMs) have made remarkable advancements in the field of natural language processing.
ParChain: A Framework for Parallel Hierarchical Agglomerative Clustering using Nearest-Neighbor Chain
This paper studies the hierarchical clustering problem, where the goal is to produce a dendrogram that represents clusters at varying scales of a data set.
Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering
Our approach is based on generating a well-separated pair decomposition followed by using Kruskal's minimum spanning tree algorithm and bichromatic closest pair computations.
Modeling and Analysis of Tagging Networks in Stack Exchange Communities
Large Question-and-Answer (Q&A) platforms support diverse knowledge curation on the Web.
