5 citations · 12 across the 11 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
cs.CG2014
Randomized embeddings with slack, and high-dimensional Approximate Nearest Neighbor
Evangelos Anagnostopoulos, Ioannis Z. Emiris, Ioannis Psarros
The approximate nearest neighbor problem (-ANN) in high dimensional Euclidean space has been mainly addressed by Locality Sensitive Hashing (LSH), which has polynomial dependenc…
cs.CG2014★ 3 cited
Counting Euclidean embeddings of rigid graphs
Ioannis Z. Emiris, Ioannis Psarros
A graph is called (generically) rigid in if, for any choice of sufficiently generic edge lengths, it can be embedded in in a finite number of distinct…