1![Surname identification and correction in a corpus of forename surname dataset Suresh Veluru, Yogachandran Rahulamathavan, and Muttukrishnan Rajarajan Information Security Group, School of Engineering and Mathematical Sci Surname identification and correction in a corpus of forename surname dataset Suresh Veluru, Yogachandran Rahulamathavan, and Muttukrishnan Rajarajan Information Security Group, School of Engineering and Mathematical Sci](https://www.pdfsearch.io/img/01b2009a2bc5fd1c272ab733a8f99660.jpg) | Add to Reading ListSource URL: www.uncertaintyofidentity.comLanguage: English - Date: 2013-04-26 11:31:05
|
---|
2![A Quadratic Regulator-Based Heuristic for Rapidly Exploring State Space Elena Glassman and Russ Tedrake Abstract— Kinodynamic planning algorithms like RapidlyExploring Randomized Trees (RRTs) hold the promise of findin A Quadratic Regulator-Based Heuristic for Rapidly Exploring State Space Elena Glassman and Russ Tedrake Abstract— Kinodynamic planning algorithms like RapidlyExploring Randomized Trees (RRTs) hold the promise of findin](https://www.pdfsearch.io/img/8037c4f0d8e7b4024c08909f65b98700.jpg) | Add to Reading ListSource URL: eglassman.github.ioLanguage: English - Date: 2016-07-29 16:41:12
|
---|
3![Apresentacao do PowerPoint Apresentacao do PowerPoint](https://www.pdfsearch.io/img/1044f736174647a0bbe99d7d48c0563f.jpg) | Add to Reading ListSource URL: i.cs.hku.hkLanguage: English - Date: 2008-07-13 12:49:12
|
---|
4![CS168: The Modern Algorithmic Toolbox Lecture #3: Similarity Metrics and kd-Trees Tim Roughgarden & Gregory Valiant April 6, CS168: The Modern Algorithmic Toolbox Lecture #3: Similarity Metrics and kd-Trees Tim Roughgarden & Gregory Valiant April 6,](https://www.pdfsearch.io/img/f350aaf666df7368c2ce136909baeea2.jpg) | Add to Reading ListSource URL: theory.stanford.eduLanguage: English - Date: 2016-06-04 09:49:43
|
---|
5![COVER TREES FOR NEAREST NEIGHBOR ALINA BEYGELZIMER, SHAM KAKADE, AND JOHN LANGFORD A BSTRACT. We present a tree data structure for fast nearest neighbor operations in general n-point metric spaces. The data structure req COVER TREES FOR NEAREST NEIGHBOR ALINA BEYGELZIMER, SHAM KAKADE, AND JOHN LANGFORD A BSTRACT. We present a tree data structure for fast nearest neighbor operations in general n-point metric spaces. The data structure req](https://www.pdfsearch.io/img/9d35ec7d012e73baf7039a58f322c272.jpg) | Add to Reading ListSource URL: hunch.netLanguage: English - Date: 2011-03-14 15:29:00
|
---|
6![Approximating the Minimum Spanning Tree of Set of Points in the Hausdorff Metric Victor Alvarez∗ Raimund Seidel† Approximating the Minimum Spanning Tree of Set of Points in the Hausdorff Metric Victor Alvarez∗ Raimund Seidel†](https://www.pdfsearch.io/img/326f4b1559e65a2204a8fd2f3ddb3bb0.jpg) | Add to Reading ListSource URL: www.victoralvarez.netLanguage: English - Date: 2014-05-29 18:33:09
|
---|
7![Metrics
Frama-C’s metrics plug-inNitrogen) Richard Bonichon & Boris Yakobowski Metrics
Frama-C’s metrics plug-inNitrogen) Richard Bonichon & Boris Yakobowski](https://www.pdfsearch.io/img/9efb296eb750284913bed267dfc9976b.jpg) | Add to Reading ListSource URL: frama-c.comLanguage: English - Date: 2013-09-24 04:53:47
|
---|
8![Approximating TSP on Metrics with Bounded Global Growth∗ T-H. Hubert Chan Abstract The Traveling Salesman Problem (TSP) is a canonical NP-complete problem which is known to be MAXSNP hard even on (high-dimensional) Euc Approximating TSP on Metrics with Bounded Global Growth∗ T-H. Hubert Chan Abstract The Traveling Salesman Problem (TSP) is a canonical NP-complete problem which is known to be MAXSNP hard even on (high-dimensional) Euc](https://www.pdfsearch.io/img/6031414a6acdd42643cc341b1932f235.jpg) | Add to Reading ListSource URL: i.cs.hku.hkLanguage: English - Date: 2007-10-10 14:10:39
|
---|
9![Space-Time Tradeoffs for Proximity Searching in Doubling Spaces Sunil Arya⋆1 , David M. Mount⋆⋆2 , Antoine Vigneron⋆ ⋆ ⋆3 , and Jian Xia†1 1 2 Space-Time Tradeoffs for Proximity Searching in Doubling Spaces Sunil Arya⋆1 , David M. Mount⋆⋆2 , Antoine Vigneron⋆ ⋆ ⋆3 , and Jian Xia†1 1 2](https://www.pdfsearch.io/img/1c56bfdbef88c8beda78043c469906f6.jpg) | Add to Reading ListSource URL: www.cse.ust.hkLanguage: English - Date: 2010-08-18 05:43:59
|
---|
10![On the Hyperbolicity of Small-World and Tree-Like Random Graphs Wei Chen1 , Wenjie Fang2 , Guangda Hu3 , and Michael W. Mahoney4 1 Microsoft Research Asia On the Hyperbolicity of Small-World and Tree-Like Random Graphs Wei Chen1 , Wenjie Fang2 , Guangda Hu3 , and Michael W. Mahoney4 1 Microsoft Research Asia](https://www.pdfsearch.io/img/cf2f891a1166c654f2bf931f924b3836.jpg) | Add to Reading ListSource URL: www.cs.yale.eduLanguage: English - Date: 2013-02-22 15:51:39
|
---|