咨询与建议

限定检索结果

文献类型

  • 13 篇 期刊文献
  • 8 篇 会议

馆藏范围

  • 21 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 18 篇 工学
    • 14 篇 计算机科学与技术...
    • 6 篇 电气工程
    • 4 篇 软件工程
    • 3 篇 控制科学与工程
    • 1 篇 信息与通信工程
  • 12 篇 理学
    • 10 篇 数学
    • 2 篇 物理学
    • 1 篇 统计学(可授理学、...
  • 1 篇 经济学
    • 1 篇 应用经济学
  • 1 篇 管理学
    • 1 篇 管理科学与工程(可...

主题

  • 21 篇 lattice algorith...
  • 4 篇 closest vector p...
  • 3 篇 approximation al...
  • 3 篇 high dimensional...
  • 1 篇 nearest plane al...
  • 1 篇 convex coverings
  • 1 篇 ladder algorithm...
  • 1 篇 identification o...
  • 1 篇 macbeath regions
  • 1 篇 lattices
  • 1 篇 recursive instru...
  • 1 篇 minimum descript...
  • 1 篇 distributive kno...
  • 1 篇 shortest vector ...
  • 1 篇 component-by-com...
  • 1 篇 embedded lattice...
  • 1 篇 nearest neighbor
  • 1 篇 bic
  • 1 篇 aic
  • 1 篇 multichannel fil...

机构

  • 2 篇 ecole polytech p...
  • 2 篇 aix marseille un...
  • 2 篇 pontificia univ ...
  • 2 篇 lis lab marseill...
  • 2 篇 hong kong univ s...
  • 2 篇 ecole polytech p...
  • 1 篇 inria
  • 1 篇 acad sinica inst...
  • 1 篇 univ so calif de...
  • 1 篇 univ maryland in...
  • 1 篇 univ oxford math...
  • 1 篇 natl taiwan univ...
  • 1 篇 cwi
  • 1 篇 ecole polytech f...
  • 1 篇 institute of adv...
  • 1 篇 univ tecn lisboa...
  • 1 篇 northwestern uni...
  • 1 篇 univ limoges lim...
  • 1 篇 univ maryland de...
  • 1 篇 univ minnesota d...

作者

  • 2 篇 quintero santiag...
  • 2 篇 da fonseca guilh...
  • 2 篇 arya sunil
  • 2 篇 valencia frank
  • 2 篇 ramirez sergio
  • 2 篇 mount david m.
  • 1 篇 hannan e.j.
  • 1 篇 szabo gabor
  • 1 篇 kao ming-yang
  • 1 篇 nuyens dirk
  • 1 篇 li jianwei
  • 1 篇 kovacs laszlo
  • 1 篇 strobach p
  • 1 篇 dellar paul j.
  • 1 篇 mo weiwen
  • 1 篇 gomes joao
  • 1 篇 rothvoss thomas
  • 1 篇 micciancio danie...
  • 1 篇 barroso victor a...
  • 1 篇 yasuda masaya

语言

  • 20 篇 英文
  • 1 篇 其他
检索条件"主题词=Lattice algorithms"
21 条 记 录,以下是1-10 订阅
排序:
Constructing Embedded lattice-Based algorithms for Multivariate Function Approximation with a Composite Number of Points
收藏 引用
CONSTRUCTIVE APPROXIMATION 2025年 第1期61卷 81-113页
作者: Kuo, Frances Y. Mo, Weiwen Nuyens, Dirk UNSW Sydney Sch Math & Stat Sydney NSW 2052 Australia Dept Comp Sci KU Leuven Celestijnenlaan 200A B-3001 Leuven Belgium
We approximate d-variate periodic functions in weighted Korobov spaces with general weight parameters using n function values at lattice points. We do not limit n to be a prime number, as in currently available litera... 详细信息
来源: 评论
A quantum lattice algorithm with fourth-order accuracy for the one-dimensional Dirac equation
收藏 引用
JOURNAL OF COMPUTATIONAL PHYSICS 2025年 533卷
作者: Dellar, Paul J. Univ Oxford Math Inst Radcliffe Observ Quarter Oxford OX2 6GG England
The discrete time quantum walk is a quantum cellular automaton whose wavefunction comprises pairs of complex numbers assigned to uniformly spaced points on a line. The wavefunction evolves through the application of a... 详细信息
来源: 评论
ECONOMICAL CONVEX COVERINGS AND APPLICATIONS
收藏 引用
SIAM JOURNAL ON COMPUTING 2024年 第4期53卷 1002-1038页
作者: Arya, Sunil da Fonseca, Guilherme D. Mount, David M. Hong Kong Univ Sci & Technol Dept Comp Sci & Engn Hong Kong Peoples R China Aix Marseille Univ Marseille France LIS Lab Marseille France Univ Maryland Dept Comp Sci College Pk MD USA Univ Maryland Inst Adv Comp Studies College Pk MD USA
Coverings of convex bodies have emerged as a central component in the design of efficient solutions to approximation problems involving convex bodies. Intuitively, given a convex body K and epsilon > 0, a covering ... 详细信息
来源: 评论
Experimental Analysis of Integer Factorization Methods Using lattices  1
收藏 引用
19th International Workshop on Security on Advances in Information and Computer Security (IWSEC)
作者: Sato, Arata Auzemery, Aurelien Katayama, Akira Yasuda, Masaya Rikkyo Univ Tokyo Japan Univ Limoges Limoges France
Since 1991, Schnorr has proposed methods using lattices for solving the integer factorization problem whose hardness supports the security of the RSA cryptosystem. In 2022, Yan et al. proposed a modification of Schnor... 详细信息
来源: 评论
Economical Convex Coverings and Applications  34
Economical Convex Coverings and Applications
收藏 引用
34th ACM-SIAM Annual Symposium on Discrete algorithms (SODA)
作者: Arya, Sunil da Fonseca, Guilherme D. Mount, David M. Hong Kong Univ Sci & Technol Dept Comp Sci & Engn Hong Kong Peoples R China Aix Marseille Univ Marseille France LIS Lab Marseille France Univ Maryland Dept Comp Sci College Pk MD 20742 USA Univ Maryland Inst Adv Comp Studies College Pk MD 20742 USA
Coverings of convex bodies have emerged as a central component in the design of efficient solutions to approximation problems involving convex bodies. Intuitively, given a convex body K and epsilon > 0, a covering ... 详细信息
来源: 评论
Approximate CVP in Time 20.802n - Now in Any Norm!  23rd
Approximate CVP in Time 2<SUP>0.802n</SUP> - Now in Any Norm...
收藏 引用
23rd International Conference on Integer Programming and Combinatorial Optimization (IPCO)
作者: Rothvoss, Thomas Venzin, Moritz Univ Washington Seattle WA 98195 USA Ecole Polytech Fed Lausanne EPFL Lausanne Switzerland
We show that a constant factor approximation of the shortest and closest lattice vector problem in any norm can be computed in time 2(0.802 n). This contrasts the corresponding 2(n) time, (gap)-SETH based lower bounds... 详细信息
来源: 评论
Computing Distributed Knowledge as the Greatest Lower Bound of Knowledge  19th
Computing Distributed Knowledge as the Greatest Lower Bound ...
收藏 引用
19th International Conference on Relational and Algebraic Methods in Computer Science (RAMiCS)
作者: Pinzon, Carlos Quintero, Santiago Ramirez, Sergio Valencia, Frank Ecole Polytech Paris CNRS LIX Palaiseau France Pontificia Univ Javeriana Cali Cali Colombia Ecole Polytech Paris LIX Palaiseau France INRIA Saclay Palaiseau France
Let L be a distributive lattice and E(L) be the set of join endomorphisms of L. We consider the problem of finding f Pi(E(L)) g given L and f, g is an element of E(L) as inputs. (1) We show that it can be solved in ti... 详细信息
来源: 评论
lattice-Filter-Based Multivariate Autoregressive Spectral Estimation With Joint Model Order and Estimation Bandwidth Adaptation
收藏 引用
IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2019年 第12期64卷 4968-4981页
作者: Niedzwiecki, Maciej Meller, Michal Chojnacki, Damian Gdansk Univ Technol Dept Automat Control Fac Elect Telecommun & Comp Sci PL-80233 Gdansk Poland
The problem of parametric autoregressive model-based estimation of a time-varying spectral density function of a multivariate nonstationary process is considered. It is shown that estimation results can be considerabl... 详细信息
来源: 评论
Counting and Computing Join-Endomorphisms in lattices  1
收藏 引用
18th International Conference on Relational and Algebraic Methods in Computer Science (RAMiCS)
作者: Quintero, Santiago Ramirez, Sergio Rueda, Camilo Valencia, Frank Pontificia Univ Javeriana Cali Cali Colombia Ecole Polytech Paris LIX Palaiseau France Ecole Polytech Paris CNRS LIX Palaiseau France
Structures involving a lattice and join-endomorphisms on it are ubiquitous in computer science. We study the cardinality of the set E(L) of all join-endomorphisms of a given finite lattice L. In particular, we show th... 详细信息
来源: 评论
Computing a lattice Basis Revisited  19
Computing a Lattice Basis Revisited
收藏 引用
44th ACM International Symposium on Symbolic and Algebraic Computation (ISSAC)
作者: Li, Jianwei Nguyen, Phong Q. NUS CQT Singapore Singapore Chinese Acad Sci AMSS KLMM Beijing Peoples R China Inria Paris France Univ Tokyo JFLI CNRS Tokyo Japan
Given (a, b) is an element of Z(2), Euclid's algorithm outputs the generator gcd(a, b) of the ideal aZ+ bZ. Computing a lattice basis is a high-dimensional generalization: given a(1), ... , a(n) is an element of Z... 详细信息
来源: 评论