1871 search results - page 344 / 375 » The Ephemeral Pairing Problem |
121
click to vote
SODA
2010
ACM
15 years 8 months ago
2010
ACM
We present a simple and practical algorithm for the c-approximate near neighbor problem (c-NN): given n points P Rd and radius R, build a data structure which, given q Rd , can ...
SODA
2010
ACM
15 years 8 months ago
2010
ACM
A Random Geometric Graph (RGG) in two dimensions is constructed by distributing n nodes independently and uniformly at random in [0, n ]2 and creating edges between every pair of...
EUROGRAPHICS
2010
Eurographics
15 years 8 months ago
2010
Eurographics
This paper challenges the difficult problem of automatic semantic correspondence between two given shapes which are semantically similar but possibly geometrically very different...
116
Voted
WWW
2010
ACM
15 years 6 months ago
2010
ACM
Researchers increasingly use electronic communication data to construct and study large social networks, effectively inferring unobserved ties (e.g. i is connected to j) from obs...
107
click to vote
WWW
2010
ACM
15 years 6 months ago
2010
ACM
Duplicate URLs have brought serious troubles to the whole pipeline of a search engine, from crawling, indexing, to result serving. URL normalization is to transform duplicate URLs...