49 citations · 63 across the 6 of their papers we have counts for
6 papers
Approximate Furthest Neighbor with Application to Annulus Query
Rasmus Pagh, Francesco Silvestri, Johan Sivertsen +1
Much recent work has been devoted to approximate nearest neighbor queries. Motivated by applications in recommender systems, we consider approximate furthest neighbor (AFN) queries…
Graph Nimors
Matthew Skala
In the game of Graph Nimors, two players alternately perform graph minor operations (deletion and contraction of edges) on a graph until no edges remain, at which point the player…
A Structural Query System for Han Characters
Matthew Skala
The IDSgrep structural query system for Han character dictionaries is presented. This system includes a data model and syntax for describing the spatial structure of Han characters…
Hypergeometric tail inequalities: ending the insanity
Matthew Skala
The hypergeometric distribution is briefly and informally surveyed, including popular notation, symmetries, and the tail inequalities and $Pr[i \…
Cycle-maximal triangle-free graphs
Stephane Durocher, David S. Gunderson, Pak Ching Li +1
We conjecture that the balanced complete bipartite graph contains more cycles than any other -vertex triangle-free graph, and we make…
Robust Non-Parametric Data Approximation of Pointsets via Data Reduction
Stephane Durocher, Alexandre Leblanc, Jason Morrison +1
In this paper we present a novel non-parametric method of simplifying piecewise linear curves and we apply this method as a statistical approximation of structure within sequential…