• 学术搜索
  • 科研智能体
    • Research Labs
    • AI 阅读
    • AI 文库
    • 深度研究
    • 学者亮点
  • 学术资源
    • AI2000
    • 期刊/会议
    • 学者库
    • 学术API
    • 溯源树
    • 数据集
  • 知识沉淀
    • 学术空间
订阅小程序
旧版功能
aminer vip
开通会员低至0.73元/天
一次搞定AI科研
立即登录
  • English
  • 联系方式
    诺基亚

    诺基亚

    Nokia Inc.
    企业
    2,668论文总数
    6.3万引用总数

    论文量&引用量时间轴

    机构学者

    排序
    Seppo Yrjola
    Seppo Yrjola
    Nokia; University of Oulu
    论文:42引用:0H-index:0
    Zami, T.
    Zami, T.
    Nokia, Nozay 91620, France
    论文:37引用:0H-index:0
    Bruno Lavigne
    Bruno Lavigne
    Nokia
    论文:16引用:0H-index:0
    Antonio Napoli
    Antonio Napoli
    Coriant R&D GmbH, D-81541 Munich, Germany
    论文:15引用:0H-index:0
    Pablo Pérez
    Pablo Pérez
    Network and Systems Integration division, Alcatel-Lucent
    论文:14引用:0H-index:0
    Roland Ryf
    Roland Ryf
    Nokia Bell Labs
    论文:14引用:0H-index:0
    Preben Mogensen
    Preben Mogensen
    Department of Electronic Systems, The Technical Faculty of IT and Design, Aalborg University;Nokia Bell Labs
    论文:14引用:0H-index:0
    Daniela Laselva
    Daniela Laselva
    Nokia Siemens Networks
    论文:13引用:0H-index:0
    Klaus Pedersen
    Klaus Pedersen
    Nokia Bell Labs;Department of Electronic Systems, The Technical Faculty of IT and Design, Aalborg University
    论文:13引用:0H-index:0

    论文(2669)

    年份
    起
    –
    止
    排序
    1Computing Multi-Scalar Multiplication on Memory-Constrained Devices
    Léo Noël, Thomas Plantard

    Multi-Scalar Multiplication is a critical operation in most pairing-based zero-knowledge proofs. In a lot of studies, memory limitations have often been reported to be the primary bottleneck preventing the calculation of larger MSMs. In this paper, we are particularly interested in the acceleration of this operation on devices with limited memory. Pippenger’s algorithm (also known as bucket method) is the most efficient and, consequently, the most widely used method to calculate Multi-Scalar Multiplications. We propose an optimization of Pippenger’s algorithm which is at least as efficient as the original, and significantly more effective when operating under limited memory. The main idea is to use an adapted number of buckets depending on the available memory instead of 2^w - 1 . We conducted tests on the curve BLS12-381 with Multi-Scalar Multiplications ranging from 2^8 to 2^14 points. The results obtained demonstrate that we have a very significant gain (up to 40% ) for very limited memories. This gain gradually decreases as more memory becomes available, until we achieve performance comparable to Pippenger’s once memory is no longer limited. For example, in a Multi-Scalar Multiplication with 2^13 points, we observe a gain of 40% with only 1 KB of memory, 20% with 15 KB, 15% with 35 KB, and so on, down to be equivalent to Pippenger’s algorithm once memory is no longer a constraint.

    2026Journal of Cryptographic Engineering(2026)引用:5
    引用
    AI阅读
    加入学术空间
    2Thinking Before Constraining: A Unified Decoding Framework for Large Language Models
    Ngoc Trinh Hung Nguyen, Alonso Silva, Laith Zumot, Liubov Tupikina, Armen Aghasaryan, Mehwish Alam

    Natural generation allows Language Models (LMs) to produce free-form responses with rich reasoning, but the lack of guaranteed structure makes outputs difficult to parse or verify. Structured generation, or constrained decoding, addresses this drawback by producing content in standardized formats such as JSON, ensuring consistency and guaranteed-parsable outputs, but it can inadvertently restrict the model's reasoning capabilities. In this work, we propose a simple approach that combines the advantages of both natural and structured generation. By allowing LLMs to reason freely until specific trigger tokens are generated, and then switching to structured generation, our method preserves the expressive power of natural language reasoning while ensuring the reliability of structured outputs. We further evaluate our approach on several datasets, covering both classification and reasoning tasks, to demonstrate its effectiveness, achieving a substantial gain of up to 27

    2026CoRR(2026)引用:5
    引用
    AI阅读
    加入学术空间
    3Beyond Omnidirectional: Neural Ambisonics Encoding for Arbitrary Microphone Directivity Patterns Using Cross-Attention
    Mikko Heikkinen,Archontis Politis,Konstantinos Drossos,Tuomas Virtanen

    We present a deep neural network approach for encoding microphone array signals into Ambisonics that generalizes to arbitrary microphone array configurations with fixed microphone count but varying locations and frequency-dependent directional characteristics. Unlike previous methods that rely only on array geometry as metadata, our approach uses directional array transfer functions, enabling accurate characterization of real-world arrays. The proposed architecture employs separate encoders for audio and directional responses, combining them through cross-attention mechanisms to generate array-independent spatial audio representations. We evaluate the method on simulated data in two settings: a mobile phone with complex body scattering, and a free-field condition, both with varying numbers of sound sources in reverberant environments. Evaluations demonstrate that our approach outperforms both conventional digital signal processing-based methods and existing deep neural network solutions. Furthermore, using array transfer functions instead of geometry as metadata input improves accuracy on realistic arrays.

    2026ICASSP 2026 - 2026 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)(2026)引用:3
    引用
    AI阅读
    加入学术空间
    4Optimal Placement of Hollow-Core Fiber Spans in Optical Transport Networks with CAPEX Constraints
    João Pedro,Bruno Correia, Diogo Morão

    This paper presents a method to optimally place a limited number of hollow-core fiber (HCF) spans and high-power booster/in-line-amplifiers in optical mesh networks. Results show it effectively increases network capacity/reach while enforcing the CAPEX-related constraint.

    20262026 Optical Fiber Communications Conference and Exhibition (OFC)(2026)引用:3
    引用
    AI阅读
    加入学术空间
    5Hollow-Core Fiber Properties and System-Level Specifications for Next-Generation Optical Transport Networks
    Bruno Correia,Joao Pedro

    In light of the recent advances in hollow-core fiber (HCF) design and manufacturing, wide-scale deployments of this fiber type to realize next-generation optical transport networks may become viable in the foreseeable future, with benefits in terms of lower latency and improved capacity/reach. Nevertheless, several uncertainties remain regarding the properties of HCF that can be manufactured at scale, as well as the specifications of optical amplifiers developed to leverage the negligible low linearity of this fiber type. This work evaluates the performance of HCFs considering a wide range of potential fiber and amplifier parameters and compares them with traditional standard single-mode fiber (SSMF) and pure-silica-core fiber (PSCF). The resulting analysis allows us to determine, at a system and network level, the combination of fiber and amplifier parameters that will allow HCF to become a competitive transmission medium for next-generation optical transport networks.

    2026PHOTONICS(2026)引用:2
    引用
    AI阅读
    加入学术空间
    立即登录,查看全部 2669 篇论文

    合作机构(100)

    贝尔实验室合作论文 144
    奥卢大学合作论文 101
    阿尔托大学合作论文 77
    奥尔堡大学合作论文 58
    坦佩雷理工大学合作论文 48
    VTT 技术研究中心 of Finland合作论文 40
    坦佩雷大学合作论文 39
    北京邮电大学合作论文 33
    英特尔公司合作论文 32
    爱立信合作论文 31

    机构统计