咨询与建议

限定检索结果

文献类型

  • 178 篇 会议
  • 89 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

  • 153 篇 工学
    • 104 篇 计算机科学与技术...
    • 56 篇 软件工程
    • 39 篇 电子科学与技术(可...
    • 39 篇 信息与通信工程
    • 20 篇 光学工程
    • 17 篇 控制科学与工程
    • 14 篇 电气工程
    • 12 篇 生物工程
    • 10 篇 生物医学工程(可授...
    • 9 篇 动力工程及工程热...
    • 9 篇 化学工程与技术
    • 7 篇 机械工程
    • 7 篇 交通运输工程
    • 5 篇 力学(可授工学、理...
    • 5 篇 材料科学与工程(可...
    • 5 篇 安全科学与工程
    • 4 篇 仪器科学与技术
    • 3 篇 农业工程
  • 96 篇 理学
    • 66 篇 数学
    • 29 篇 物理学
    • 13 篇 生物学
    • 13 篇 统计学(可授理学、...
    • 9 篇 化学
    • 4 篇 系统科学
  • 18 篇 管理学
    • 17 篇 管理科学与工程(可...
    • 5 篇 工商管理
  • 5 篇 法学
    • 5 篇 社会学
  • 5 篇 医学
    • 5 篇 临床医学
    • 4 篇 基础医学(可授医学...
  • 3 篇 农学
  • 2 篇 经济学

主题

  • 16 篇 routing
  • 12 篇 microelectronics
  • 10 篇 throughput
  • 10 篇 wireless sensor ...
  • 8 篇 computer science
  • 8 篇 interference
  • 8 篇 computational mo...
  • 7 篇 base stations
  • 7 篇 error correction
  • 7 篇 logic gates
  • 6 篇 delays
  • 6 篇 bandwidth
  • 6 篇 algorithm design...
  • 6 篇 topology
  • 6 篇 protocols
  • 6 篇 field programmab...
  • 6 篇 measurement
  • 6 篇 computer network...
  • 5 篇 network topology
  • 5 篇 resource managem...

机构

  • 97 篇 advanced computi...
  • 41 篇 advanced computi...
  • 23 篇 advanced computi...
  • 16 篇 advanced computi...
  • 9 篇 advanced computi...
  • 8 篇 a. k. choudhury ...
  • 6 篇 advanced computi...
  • 6 篇 indian statistic...
  • 4 篇 indian statistic...
  • 4 篇 the advanced com...
  • 4 篇 department of co...
  • 4 篇 advanced computi...
  • 4 篇 advanced computi...
  • 4 篇 ibm quantum ibm ...
  • 4 篇 atos pune
  • 4 篇 department of ma...
  • 3 篇 advanced computi...
  • 3 篇 department of el...
  • 3 篇 advance computin...
  • 3 篇 department of co...

作者

  • 35 篇 ghosh sasthi c.
  • 26 篇 majumdar ritajit
  • 25 篇 sasthi c. ghosh
  • 24 篇 sur-kolay susmit...
  • 20 篇 susmita sur-kola...
  • 18 篇 das sandip
  • 16 篇 bhattacharya bha...
  • 16 篇 bhargab b. bhatt...
  • 14 篇 ansuman banerjee
  • 14 篇 nabanita das
  • 11 篇 bhoumik debasmit...
  • 11 篇 mukhopadhyaya kr...
  • 8 篇 nandy subhas c.
  • 7 篇 ritajit majumdar
  • 7 篇 das nabanita
  • 7 篇 chakrabarti amla...
  • 7 篇 sinha bhabani p.
  • 6 篇 mukherjee priyad...
  • 6 篇 bose kaustav
  • 6 篇 koley subhasis

语言

  • 262 篇 英文
  • 5 篇 其他
检索条件"机构=Advanced Computing And Microelectronics Unit Indian Statistical Institute"
267 条 记 录,以下是61-70 订阅
排序:
Distributed Scheduling of Quantum Circuits with Noise and Time Optimization
arXiv
收藏 引用
arXiv 2023年
作者: Bhoumik, Debasmita Majumdar, Ritajit Saha, Amit Sur-Kolay, Susmita Advanced Computing & Microelectronics Unit Indian Statistical Institute India IBM Quantum IBM India Research Lab India A. K. Choudhury School of Information Technology University of Calcutta India
Quantum computers are noisy at present in the absence of error correction and fault tolerance. Interim methods such as error suppression and mitigation find wide applicability. Another method, which is independent of ... 详细信息
来源: 评论
Improved bounds on the span of L(1, 2)-edge labeling of some infinite regular grids
arXiv
收藏 引用
arXiv 2022年
作者: Bandopadhyay, Susobhan Ghosh, Sasthi C. Koley, Subhasis School Of Computer Sciences National Institute Of Science Education And Research Bhubaneswar India Advanced Computing And Microelectronics Unit Indian Statistical Institute Kolkata India
For two given nonnegative integers h and k, an L(h, k)-edge labeling of a graph G is the assignment of labels {0, 1,⋯, n} to the edges so that two edges having a common vertex are labeled with difference at least h an... 详细信息
来源: 评论
MAB based Network Selection mechanism for URLLC users in RIS assisted network
MAB based Network Selection mechanism for URLLC users in RIS...
收藏 引用
IEEE International Symposium on Network computing and Applications
作者: Souvik Deb Shankar Kumar Ghosh Sasthi C. Ghosh Advanced Computing & Microelectronics Unit Indian Statistical Institute Kolkata India Department of CSE Shiv Nadar Institution of Eminence Delhi NCR India
In this work, a network selection mechanism for re-configurable intelligent surface (RIS) assisted network has been proposed. The goal of the proposed mechanism is to select appropriate base station (BS) or BS-RIS pai... 详细信息
来源: 评论
Asymptotically improved circuit for a d-ary Grover's algorithm with advanced decomposition of the n-qudit Toffoli gate
收藏 引用
Physical Review A 2022年 第6期105卷 062453-062453页
作者: Amit Saha Ritajit Majumdar Debasri Saha Amlan Chakrabarti Susmita Sur-Kolay A. K. Choudhury School of Information Technology University of Calcutta Calcutta 700106 India ATOS Pune 411045 India Advanced Computing & Microelectronics Unit Indian Statistical Institute Calcutta 700108 India
The progress in building quantum computers to execute quantum algorithms has recently been remarkable. Grover's search algorithm in a binary quantum system provides a considerable speed-up over the classical parad... 详细信息
来源: 评论
MINIMUM CONSISTENT SUBSET IN TREES AND INTERVAL GRAPHS
arXiv
收藏 引用
arXiv 2024年
作者: Banik, Aritra Das, Sayani Maheshwari, Anil Manna, Bubai Nandy, Subhas C. Krishna Priya, K.M. Roy, Bodhayan Roy, Sasanka Sahu, Abhishek National Institute of Science Education and Research An OCC of Homi Bhabha National Institute Odisha Bhubaneswar752050 India Theoretical Computer Science The Institute of Mathematical Sciences India School of Computer Science Carleton University Canada Department of Mathematics Indian Institute of Technology Kharagpur India Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India
In the Minimum Consistent Subset (MCS) problem, we are presented with a connected simple undirected graph G = (V, E), consisting of a vertex set V of size n and an edge set E. Each vertex in V is assigned a color from... 详细信息
来源: 评论
Evaluating Conditional Handover for 5g Networks with Dynamic Obstacles
SSRN
收藏 引用
SSRN 2024年
作者: Deb, Souvik Rathod, Megh Balamurugan, Rishi Singh, Rajeev Kumar Sanyal, Samriddha Ghosh, Shankar K. Advanced Computing & Microelectronics Unit Indian Statistical Institute West Bengal Kolkata700108 India Department of Computer Science and Engineering Shiv Nadar Institution of Eminence Delhi201314 India School of Computing and Data Science FLAME University Maharashtra Pune412115 India Shiv Nadar University India
To enhance seamless connectivity in millimetre wave New radio networks, Conditional handover has evolved as a promising solution. Unlike A3 handover where handover execution is certain after receiving handover command... 详细信息
来源: 评论
SOK: An Evaluation of Quantum Authentication through Systematic Literature Review
SSRN
收藏 引用
SSRN 2021年
作者: Majumdar, Ritajit Das, Sanchari Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India University of Denver
Quantum computers are considered a blessing to the dynamic technological world that promises to solve complex problems much faster than their known classical counterparts. Such computational power imposes critical thr... 详细信息
来源: 评论
On Fault Tolerance of Circuits with Intermediate Qutrit-assisted Gate Decomposition
arXiv
收藏 引用
arXiv 2022年
作者: Majumdar, Ritajit A., Saha A., Chakrabarti S., Sur-Kolay Advanced Computing & Microelectronics Unit Indian Statistical Institute India Atos Pune India A. K. Choudhury School of Information Technology University of Calcutta India
The use of a few intermediate qutrits for efficient decomposition of 3-qubit unitary gates has been proposed, to obtain an exponential reduction in the depth of the decomposed circuit. An intermediate qutrit implies t... 详细信息
来源: 评论
Approximate Shortest Paths in Polygons with Violations
收藏 引用
International Journal of Computational Geometry and Applications 2020年 第1期30卷 79-95页
作者: Dutta, Binayak Roy, Sasanka Department of Computer Science and Engineering Tezpur University Tezpur India Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India
We study the shortest k-violation path problem in a simple polygon. Let P be a simple polygon in 2 with n vertices and let s,t be a pair of points in P. Let int(P) represent the interior of P. Let P = 2(P) represent t... 详细信息
来源: 评论
Parking Problem by Oblivious Mobile Robots in Infinite Grids
arXiv
收藏 引用
arXiv 2023年
作者: Chakraborty, Abhinav Mukhopadhyaya, Krishnendu Department of Computer Science and Engineering Institute of Technical Education and Research Siksha O Anusandhan University Odisha Bhubaneswar India Advanced Computing and Microelectronics Unit Indian Statistical Institute 203 B. T. Road West Bengal Kolkata700108 India
In this paper, the parking problem of a swarm of mobile robots has been studied. The robots are deployed at the nodes of an infinite grid, which has a subset of prefixed nodes marked as parking nodes. Each parking nod... 详细信息
来源: 评论