21![A simple D 2 -sampling based PTAS for k-means and other Clustering problems Ragesh Jaiswal1 , Amit Kumar1 , and Sandeep Sen1 Department of Computer Science and Engineering, Indian Institute of Technology Delhi. {rjaiswal A simple D 2 -sampling based PTAS for k-means and other Clustering problems Ragesh Jaiswal1 , Amit Kumar1 , and Sandeep Sen1 Department of Computer Science and Engineering, Indian Institute of Technology Delhi. {rjaiswal](https://www.pdfsearch.io/img/782369534a6a925e24ec45cec380b524.jpg) | Add to Reading ListSource URL: www.cse.iitd.ernet.inLanguage: English - Date: 2013-02-10 01:14:54
|
---|
22![KATIE LOVASZ Biography Katie Lovasz serves as the Development Assistant for the Oklahoma Film & Music Office. She began working for OF&MO in September ofIn that role, she edits and publishes the weekly newsletter, KATIE LOVASZ Biography Katie Lovasz serves as the Development Assistant for the Oklahoma Film & Music Office. She began working for OF&MO in September ofIn that role, she edits and publishes the weekly newsletter,](https://www.pdfsearch.io/img/e2c218393989ca911b63acbadc417a9c.jpg) | Add to Reading ListSource URL: www.ok.govLanguage: English - Date: 2013-12-02 15:26:43
|
---|
23![The nc-Unique Shortest Vector Problem is Hard Vadim Lyubashevsky∗ Abstract The unique Shortest Vector Problem (uSVP) gained prominence because it was the problem upon which the first provably-secure lattice-based crypt The nc-Unique Shortest Vector Problem is Hard Vadim Lyubashevsky∗ Abstract The unique Shortest Vector Problem (uSVP) gained prominence because it was the problem upon which the first provably-secure lattice-based crypt](https://www.pdfsearch.io/img/4a3501261a9efd4301e406775c292fc7.jpg) | Add to Reading ListSource URL: eprint.iacr.orgLanguage: English - Date: 2008-12-01 09:32:36
|
---|
24![A Fast Phase-Based Enumeration Algorithm for SVP Challenge through y-Sparse Representations of Short Lattice Vectors ? ?? Dan Ding1 , Guizhen Zhu2 , Yang Yu1 , Zhongxiang Zheng1 1 Department of Computer Science and Tech A Fast Phase-Based Enumeration Algorithm for SVP Challenge through y-Sparse Representations of Short Lattice Vectors ? ?? Dan Ding1 , Guizhen Zhu2 , Yang Yu1 , Zhongxiang Zheng1 1 Department of Computer Science and Tech](https://www.pdfsearch.io/img/dd25878fd9f304a9e2a7f96fb0c96ff8.jpg) | Add to Reading ListSource URL: eprint.iacr.orgLanguage: English - Date: 2014-12-04 01:20:06
|
---|
25![Solving the Shortest Lattice Vector Problem in Time 22.465n Xavier Pujol1 and Damien Stehl´e2 1 Universit´e de Lyon, Laboratoire LIP, CNRS-ENSL-INRIA-UCBL, 46 All´ee d’Italie, 69364 Lyon Cedex 07, France 2 Solving the Shortest Lattice Vector Problem in Time 22.465n Xavier Pujol1 and Damien Stehl´e2 1 Universit´e de Lyon, Laboratoire LIP, CNRS-ENSL-INRIA-UCBL, 46 All´ee d’Italie, 69364 Lyon Cedex 07, France 2](https://www.pdfsearch.io/img/b22adbaf29d86cb3c04a523fad06fde8.jpg) | Add to Reading ListSource URL: eprint.iacr.orgLanguage: English - Date: 2010-02-08 02:45:52
|
---|
26![Improved Nguyen-Vidick Heuristic Sieve Algorithm for Shortest Vector Problem ? Xiaoyun Wang1,2 , Mingjie Liu1 , Chengliang Tian2 and Jingguo Bi2 1 Institute for Advanced Study, Tsinghua University, Beijing, China Improved Nguyen-Vidick Heuristic Sieve Algorithm for Shortest Vector Problem ? Xiaoyun Wang1,2 , Mingjie Liu1 , Chengliang Tian2 and Jingguo Bi2 1 Institute for Advanced Study, Tsinghua University, Beijing, China](https://www.pdfsearch.io/img/991c4b7096f00f664f746ff94b565111.jpg) | Add to Reading ListSource URL: eprint.iacr.orgLanguage: English - Date: 2011-08-28 09:14:48
|
---|
27![Parallel Shortest Lattice Vector Enumeration on Graphics Cards? Jens Hermans ??1 Parallel Shortest Lattice Vector Enumeration on Graphics Cards? Jens Hermans ??1](https://www.pdfsearch.io/img/e087e0a9710cce4c475d1c776148c793.jpg) | Add to Reading ListSource URL: eprint.iacr.orgLanguage: English - Date: 2010-02-26 11:26:24
|
---|
28![Abstract Fix an integer m > 2 and let K be a number field containing the mth roots of unity with ring of integers R. Suppose that a is an element of K with a = c/d for c, d ∈ R, and that b is an ideal of R relatively Abstract Fix an integer m > 2 and let K be a number field containing the mth roots of unity with ring of integers R. Suppose that a is an element of K with a = c/d for c, d ∈ R, and that b is an ideal of R relatively](https://www.pdfsearch.io/img/bc2c295c3427f5b0858271e4d31de637.jpg) | Add to Reading ListSource URL: douglassquirrel.comLanguage: English - Date: 2013-08-17 18:16:01
|
---|
29![MSc projects at BT Research Keith Briggs keithbriggs.info MSc projects at BT Research Keith Briggs keithbriggs.info](https://www.pdfsearch.io/img/b8316f0ee43d184a8f124670c8a38cf1.jpg) | Add to Reading ListSource URL: keithbriggs.infoLanguage: English - Date: 2007-01-26 05:46:17
|
---|
30![Vinculum 42/4 FINAL[removed]:38 PM Page 6 VINCULUM VOLUME 42 NUMBER 4 NOVEMBER 2005 Vinculum 42/4 FINAL[removed]:38 PM Page 6 VINCULUM VOLUME 42 NUMBER 4 NOVEMBER 2005](https://www.pdfsearch.io/img/6912b9a026d684b834b1838a8729959b.jpg) | Add to Reading ListSource URL: www.qedcat.comLanguage: English - Date: 2008-03-04 05:04:49
|
---|