Search results for "CVP"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
73	Miklós Ajtai, Ravi Kumar 0001, D. Sivakumar 0001	Sampling Short Lattice Vectors and the Closest Lattice Vector Problem.	CCC	2002	DBLP DOI BibTeX RDF	SVP, CVP, Lattice, shortest vector problem, closest vector problem
61	Irit Dinur, Guy Kindler, Shmuel Safra	Approximating-CVP to Within Almost-Polynomial Factors is NP-Hard.	FOCS	1998	DBLP DOI BibTeX RDF	CVP, closest-vector, approximation, lattice
47	Roger Fischlin, Jean-Pierre Seifert	Tensor-Based Trapdoors for CVP and Their Application to Public Key Cryptography.	IMACC	1999	DBLP DOI BibTeX RDF
39	Daniele Micciancio	Efficient reductions among lattice problems.	SODA	2008	DBLP BibTeX RDF
39	Loong Fah Cheong, Xu Xiang	How Do Movie Viewers Perceive Scene Structure from Dynamic Cues.	CVPR (1)	2006	DBLP DOI BibTeX RDF
39	Mohammad Mahfuzul Islam, M. Manzur Murshed, Laurence Dooley	Enhanced Cell Visiting Probability for QoS Provisioning in Mobile Multimedia Communications.	ITCC (2)	2004	DBLP DOI BibTeX RDF
39	Jeffrey Hoffstein, Nick Howgrave-Graham, Jill Pipher, Joseph H. Silverman, William Whyte	NTRUSIGN: Digital Signatures Using the NTRU Lattice.	CT-RSA	2003	DBLP DOI BibTeX RDF
39	Daniele Micciancio, Salil P. Vadhan	Statistical Zero-Knowledge Proofs with Efficient Provers: Lattice Problems and More.	CRYPTO	2003	DBLP DOI BibTeX RDF
39	Gadi Haber, Yosi Ben-Asher	Parallel Solutions of Indexed Recurrence Equations.	IPPS	1997	DBLP DOI BibTeX RDF
28	Xin Zhang, Hongbo Huang, Lu Lu, Xiaoxu Yan, Zhongman Bao, Qisheng Zhao, Meihui Gong	E-CVP-MVSNet: Effective Hierarchical Multi-View 3D Reconstruction Based on Light-Weight Network.	RICAI	2023	DBLP DOI BibTeX RDF
28	Thomas Rothvoss, Moritz Venzin	Approximate $\mathrm {CVP}_{}$ in Time 20.802 n - Now in Any Norm!	IPCO	2022	DBLP DOI BibTeX RDF
28	Divesh Aggarwal, Yanlin Chen, Rajendra Kumar 0002, Zeyong Li, Noah Stephens-Davidowitz	Dimension-Preserving Reductions Between SVP and CVP in Different p-Norms.	CoRR	2021	DBLP BibTeX RDF
28	Thomas Rothvoss, Moritz Venzin	Approximate CVP in time 20.802 n - now in any norm!	CoRR	2021	DBLP BibTeX RDF
28	Divesh Aggarwal, Yanlin Chen, Rajendra Kumar 0002, Zeyong Li, Noah Stephens-Davidowitz	Dimension-Preserving Reductions Between SVP and CVP in Different p-Norms.	SODA	2021	DBLP DOI BibTeX RDF
28	Divesh Aggarwal, Huck Bennett, Alexander Golovnev, Noah Stephens-Davidowitz	Fine-grained hardness of CVP(P) - Everything that we can prove (and nothing else).	SODA	2021	DBLP DOI BibTeX RDF
28	Lei Hua, Gangyi Jiang, Mei Yu 0001, Zhouyan He	BQE-CVP: Blind Quality Evaluator for Colored Point Cloud Based on Visual Perception.	BMSB	2021	DBLP DOI BibTeX RDF
28	Friedrich Eisenbrand, Moritz Venzin	Approximate $\mathrm{CVP}_{\infty}$ in time $2^{0.802 \, n}$.	CoRR	2020	DBLP BibTeX RDF
28	Chris Karanikolas, Grigoris Dimitroulakos, Konstantinos Masselos	Experimental (raw) Data of Statistical Comparison Between Formal and Simulated Models' Outcomes for CIBI vs. CVP General Problem.		2020	DOI RDF
28	Tommaso Addabbo, Gennaro Cataldo, Gabriele Cevenini, Ada Fort, Federico Franchi, Riccardo Moretti, Marco Mugnaini, Sabino Scolletta, Valerio Vignoli	A Measurement System to Estimate the Pleural Pressure From the CVP for Respiratory System Monitoring.	IEEE Trans. Instrum. Meas.	2019	DBLP DOI BibTeX RDF
28	Vincent Corlay, Joseph J. Boutros, Philippe Ciblat, Loïc Brunel	On the CVP for the root lattices via folding with deep ReLU neural networks.	CoRR	2019	DBLP BibTeX RDF
28	Divesh Aggarwal, Huck Bennett, Alexander Golovnev, Noah Stephens-Davidowitz	Fine-grained hardness of CVP(P) - Everything that we can prove (and nothing else).	CoRR	2019	DBLP BibTeX RDF
28	Caterine Silva de Oliveira, Cesar Sanín, Edward Szczerbicki	Visual Content Learning in a Cognitive Vision Platform for Hazard Control (CVP-HC).	Cybern. Syst.	2019	DBLP DOI BibTeX RDF
28	Vincent Corlay, Joseph J. Boutros, Philippe Ciblat, Loïc Brunel	On the CVP for the root lattices via folding with deep ReLU neural networks.	ISIT	2019	DBLP DOI BibTeX RDF
28	Caterine Silva de Oliveira, Cesar Sanín, Edward Szczerbicki	Towards Knowledge Formalization and Sharing in a Cognitive Vision Platform for Hazard Control (CVP-HC).	ACIIDS (1)	2019	DBLP DOI BibTeX RDF
28	Divesh Aggarwal, Priyanka Mukhopadhyay	Faster algorithms for SVP and CVP in the ∞ norm.	CoRR	2018	DBLP BibTeX RDF
28	Divesh Aggarwal, Noah Stephens-Davidowitz	Just Take the Average! An Embarrassingly Simple 2^n-Time Algorithm for SVP (and CVP).	SOSA	2018	DBLP DOI BibTeX RDF
28	Huck Bennett, Alexander Golovnev, Noah Stephens-Davidowitz	On the Quantitative Hardness of CVP.	CoRR	2017	DBLP BibTeX RDF
28	Divesh Aggarwal, Noah Stephens-Davidowitz	Just Take the Average! An Embarrassingly Simple $2^n$-Time Algorithm for SVP (and CVP).	CoRR	2017	DBLP BibTeX RDF
28	Huck Bennett, Alexander Golovnev, Noah Stephens-Davidowitz	On the Quantitative Hardness of CVP.	FOCS	2017	DBLP DOI BibTeX RDF
28	Lianzhi Fu	Improvements in the analysis of Kannan's CVP algorithm.	Theor. Comput. Sci.	2016	DBLP DOI BibTeX RDF
28	Fábio Correia, Artur Mariano, Alberto Proença, Christian H. Bischof, Erik Agrell	Parallel Improved Schnorr-Euchner Enumeration SE++ for the CVP and SVP.	PDP	2016	DBLP DOI BibTeX RDF
28	Noah Stephens-Davidowitz	Discrete Gaussian Sampling Reduces to CVP and SVP.	SODA	2016	DBLP DOI BibTeX RDF
28	Rim Jallouli, Mohamed Jallouli, Jihene Rekik, Mohamed Anis Bach Tobji, Amna Abidi, Nassim Bahri	The CEVEP medical application for innovative management of central venous port (CVP): Technical issues and research challenges.	ICDEc	2016	DBLP DOI BibTeX RDF
28	Noah Stephens-Davidowitz	Discrete Gaussian Sampling Reduces to CVP and SVP.	CoRR	2015	DBLP BibTeX RDF
28	Jean-Claude Bajard, Julien Eynard, Nabil Merkiche, Thomas Plantard	Babaï round-off CVP method in RNS: Application to lattice based cryptographic protocols.	ISIC	2014	DBLP DOI BibTeX RDF
28	Claus-Peter Schnorr	Factoring Integers by CVP Algorithms.	Number Theory and Cryptography	2013	DBLP DOI BibTeX RDF
28	Gengran Hu, Yanbin Pan	Improvements on Reductions among Different Variants of SVP and CVP.	WISA	2013	DBLP DOI BibTeX RDF
28	Shing Tenqchen, Francis Chang, Kluo-Yueh Chen, Dong-Ling Wu, Shin-Hshun Huang	Feasibility of traveling time estimation with mutual comparison of CVP, GVP and VD technologies.	ITST	2012	DBLP DOI BibTeX RDF
28	Mingxing Tan, Xianhua Liu 0001, Tong Tong, Xu Cheng 0001	CVP: an energy-efficient indirect branch prediction with compiler-guided value pattern.	ICS	2012	DBLP DOI BibTeX RDF
28	Irit Dinur, Guy Kindler, Ran Raz, Shmuel Safra	Approximating CVP to Within Almost-Polynomial Factors is NP-Hard.	Comb.	2003	DBLP DOI BibTeX RDF	AMS Subject Classification (2000): 68Q17
28	Jin-yi Cai	On the Average-Case Hardness of CVP.	FOCS	2001	DBLP DOI BibTeX RDF
28	Irit Dinur, Guy Kindler, Shmuel Safra	Approximating CVP to Within Almost Polynomial Factor is NP-Hard	Electron. Colloquium Comput. Complex.	1998	DBLP BibTeX RDF
28	Steven Adler, Jan Heise, Matthias Mayer, Peter Schefe	CVP: Recognizable and Hierarchical 3D Overviews of the WWW by Persistence Directory Placement.	Computer Graphics International	1998	DBLP DOI BibTeX RDF
20	Thomas Plantard, Willy Susilo, Khin Than Win	A Digital Signature Scheme Based on CVPinfinity.	Public Key Cryptography	2008	DBLP DOI BibTeX RDF
20	Noboru Kunihiro	New Definition of Density on Knapsack Cryptosystems.	AFRICACRYPT	2008	DBLP DOI BibTeX RDF	Low-Weight Knapsack Cryptosystems, Lattice Attack, (pseudo-)density, Shannon Entropy
20	Daniele Micciancio	Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions.	Comput. Complex.	2007	DBLP DOI BibTeX RDF	11H06, Subject classification. 68Q17, 94B15
20	Nicolas Brisebarre, Guillaume Hanrot	Floating-point L2-approximations to functions.	IEEE Symposium on Computer Arithmetic	2007	DBLP DOI BibTeX RDF
20	Subhash Khot	Hardness of approximating the shortest vector problem in lattices.	J. ACM	2005	DBLP DOI BibTeX RDF	Approximation algorithms, cryptography, lattices, hardness of approximation, shortest vector problem
20	Mike Bailey	Layered manufacturing for scientific visualization.	Commun. ACM	2005	DBLP DOI BibTeX RDF
20	Domingo Gómez, Jaime Gutierrez 0001, Álvar Ibeas, Carmen Martínez, Ramón Beivide	On Finding a Shortest Path in Circulant Graphs with Two Jumps.	COCOON	2005	DBLP DOI BibTeX RDF
20	Ahmet Yardimci, Necmiye Hadimioglu	Fuzzy Logic Fluid Therapy Control System for Renal Transplantation.	Fuzzy Days	2004	DBLP DOI BibTeX RDF
20	Subhash Khot	Hardness of Approximating the Shortest Vector Problem in Lattices.	FOCS	2004	DBLP DOI BibTeX RDF
20	Yaw-Chu Chen	A study on the quality of credit granting in leasing: fuzzy set theory approach.	Soft Comput.	2001	DBLP DOI BibTeX RDF	Credit granting decision, Fuzzy breakeven analysis, Markov chain, Fuzzy set, Leasing
20	Terry Windeatt, Gholamreza Ardeshir	An Empirical Comparison of Pruning Methods for Ensemble Classifiers.	IDA	2001	DBLP DOI BibTeX RDF
20	Irit Dinur	Approximating SVPinfty to within Almost-Polynomial Factors Is NP-Hard.	CIAC	2000	DBLP DOI BibTeX RDF
20	Tatsuie Tsukiji, Fatos Xhafa	On the Depth of Randomly Generated Circuits.	ESA	1996	DBLP DOI BibTeX RDF