咨询与建议

限定检索结果

文献类型

  • 178 篇 会议
  • 89 篇 期刊文献
  • 3 册 图书

馆藏范围

  • 270 篇 电子文献
  • 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...
  • 21 篇 susmita sur-kola...
  • 18 篇 das sandip
  • 17 篇 bhargab b. bhatt...
  • 16 篇 bhattacharya bha...
  • 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

语言

  • 265 篇 英文
  • 5 篇 其他
检索条件"机构=Advanced Computing And Microelectronics Unit Indian Statistical Institute"
270 条 记 录,以下是31-40 订阅
排序:
Pattern Formation by Robots with Inaccurate Movements  25
Pattern Formation by Robots with Inaccurate Movements
收藏 引用
25th International Conference on Principles of Distributed Systems, OPODIS 2021
作者: Bose, Kaustav Das, Archak Sau, Buddhadeb Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India Department of Mathematics Jadavpur University Kolkata India
Arbitrary Pattern Formation is a fundamental problem in autonomous mobile robot systems. The problem asks to design a distributed algorithm that moves a team of autonomous, anonymous and identical mobile robots to for... 详细信息
来源: 评论
Pack your sack for the cloud  12
Pack your sack for the cloud
收藏 引用
5th India Software Engineering Conference, ISEC 2012
作者: Banerjee, Ansuman Ghosh, Sasthi C. Banerjee, Nilanjan Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India IBM Research - India New Delhi India
With the emergence of cloud computing, driven by significant advances in virtualization and network technologies, enterprise computing is witnessing a major paradigm shift in terms of resource consolidation. This pape... 详细信息
来源: 评论
Efficient algorithms for channel assignment in a cellular network  4th
Efficient algorithms for channel assignment in a cellular ne...
收藏 引用
4th International Workshop on Distributed computing, IWDC 2002
作者: Sinha, Bhabani P. Advanced Computing and Microelectronics Unit Indian Statistical Institute 203 B. T. Road Kolkata India
During recent years, the world is experiencing almost an exponential growth in the demand for various mobile communication services. On the other hand, the available bandwidth for such communication is very much limit...
来源: 评论
Gracefulness of vertex duplicated complete bipartite graph for static and incremental frequency allocation
收藏 引用
Electronic Notes in Discrete Mathematics 2015年 48卷 89-93页
作者: Sandhupatla, Amruth Ghosh, Sasthi C. Department of Electronics and Communication Engineering National Institute of Technology Warangal India Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India
We consider the vertex duplicated complete bipartite graph G'(VA, VB) which is formed by duplicating all the vertices of a complete bipartite graph G(A, B). We then deal with the gracefulness of G'(VA, VB) by ... 详细信息
来源: 评论
On the suitability of single-walled carbon nanotube bundle interconnects for high-speed and power-efficient applications
On the suitability of single-walled carbon nanotube bundle i...
收藏 引用
作者: Sahoo, Manodipan Rahaman, Hafizur Bhattacharya, Bhargab B. Department of Information Technology Indian Institute of Engineering Science and Technology Shibpur India Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India
In this work, the applicability of single-walled carbon nanotube bundle (SWCNT) interconnects as high-speed and power-efficient interconnects for nanometer technology node is studied. Investigations are performed for ... 详细信息
来源: 评论
Retinal blood vessel segmentation and bifurcation point detection  17th
Retinal blood vessel segmentation and bifurcation point dete...
收藏 引用
17th International Workshop on Combinatorial Image Analysis, IWCIA 2015
作者: Dutta, Tapash Dutta, Nilanjan Bandyopadhyay, Oishila Department of Information Technology Indian Institute of Engineering Science and Technology Howrah India Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India
The analysis of retinal blood vessel structure plays an important role in diagnosis of different diseases. Automated extraction of vascular network and identification of bifurcation points can be an important part of ... 详细信息
来源: 评论
On finding an empty staircase polygon of largest area (width) in a planar point-set
收藏 引用
Computational Geometry: Theory and Applications 2003年 第2期26卷 143-171页
作者: Nandy, Subhas C. Bhattacharya, Bhargab B. Advanced Computing and Micro-electronics Unit Indian Statistical Institute 203 B.T. Road Calcutta 700 108 India
This paper presents an algorithm for identifying a maximal empty-staircase-polygon (MESP) of largest area, among a set of n points on a rectangular floor. A staircase polygon is an isothetic polygon bounded by two mon... 详细信息
来源: 评论
L(2, 1)-edge labeling of Infinite Triangular Grid  22
L(2, 1)-edge labeling of Infinite Triangular Grid
收藏 引用
22nd Italian Conference on Theoretical Computer Science, ICTCS 2021
作者: Bandopadhyay, Susobhan Ghosh, Sasthi C. Koley, Subhasis National Institute Of Science Education And Research Hbni Bhubaneswar India Advanced Computing And Microelectronics Unit Indian Statistical Institute Kolkata India
An L(h, k)-edge labeling of a graph G is the assignment of labels {0, 1, · · · , n} to the edges in such a way that two adjacent edges get labels with a difference at least h and the labels of distance ... 详细信息
来源: 评论
Anomaly Detection in Evolutionary Social Networks leveraging Community Structure  15
Anomaly Detection in Evolutionary Social Networks leveraging...
收藏 引用
15th IEEE International Conference on Service Operations and Logistics, and Informatics, SOLI 2021
作者: Ghoshal, Arnab Kumar Das, Nabanita Asutosh College Department of Computer Science Kolkata India Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India
Social networks are temporally evolving by nature and in general, the evolution takes place gradually with time. But occasionally, the nodes may exhibit anomalous behavior that is to be detected and reported in real t... 详细信息
来源: 评论
Improved Lower Bound for L(1, 2)-Edge-Labeling of Infinite 8-Regular Grid  9th
Improved Lower Bound for L(1, 2)-Edge-Labeling of Infinite ...
收藏 引用
The 9th International Conference on Mathematics and computing (ICMC 2023)
作者: Koley, Subhasis Ghosh, Sasthi C. Advanced Computing and Microelectronics unit Indian Statistical Institute 203 B. T. Road Kolkata700108 India
Let us take two given integers h and k where h, k≥ 0 and a graph G= (V(G), E(G) ). An L(h, k)-edge-labeling for G is defined as a function f′: E(G) → { 0, 1, ⋯, n} such that ∀ e1, e2∈ E(G), | f′(e1) - f′(e2... 详细信息
来源: 评论