咨询与建议

限定检索结果

文献类型

  • 1,927 篇 会议
  • 142 篇 期刊文献
  • 10 册 图书

馆藏范围

  • 2,079 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 1,295 篇 工学
    • 1,181 篇 计算机科学与技术...
    • 861 篇 软件工程
    • 225 篇 信息与通信工程
    • 169 篇 控制科学与工程
    • 129 篇 电气工程
    • 77 篇 电子科学与技术(可...
    • 73 篇 生物医学工程(可授...
    • 72 篇 生物工程
    • 40 篇 建筑学
    • 36 篇 动力工程及工程热...
    • 35 篇 机械工程
    • 34 篇 光学工程
    • 29 篇 仪器科学与技术
    • 29 篇 化学工程与技术
    • 27 篇 力学(可授工学、理...
    • 27 篇 土木工程
  • 498 篇 理学
    • 377 篇 数学
    • 100 篇 物理学
    • 77 篇 统计学(可授理学、...
    • 75 篇 生物学
    • 26 篇 化学
    • 23 篇 系统科学
  • 276 篇 管理学
    • 168 篇 图书情报与档案管...
    • 123 篇 管理科学与工程(可...
    • 88 篇 工商管理
  • 66 篇 教育学
    • 64 篇 教育学
  • 63 篇 医学
    • 61 篇 临床医学
    • 34 篇 基础医学(可授医学...
    • 24 篇 药学(可授医学、理...
  • 28 篇 法学
    • 23 篇 社会学
  • 18 篇 经济学
  • 9 篇 农学
  • 3 篇 军事学
  • 1 篇 文学
  • 1 篇 艺术学

主题

  • 91 篇 mobile computing
  • 72 篇 distributed comp...
  • 69 篇 computer science
  • 53 篇 grid computing
  • 47 篇 application soft...
  • 40 篇 concurrent compu...
  • 39 篇 computational mo...
  • 36 篇 computer network...
  • 34 篇 computer archite...
  • 32 篇 cloud computing
  • 29 篇 virtual reality
  • 29 篇 ubiquitous compu...
  • 27 篇 internet
  • 26 篇 costs
  • 25 篇 laboratories
  • 23 篇 peer to peer com...
  • 23 篇 middleware
  • 20 篇 parallel process...
  • 20 篇 processor schedu...
  • 20 篇 hardware

机构

  • 20 篇 the hong kong po...
  • 18 篇 hong kong polyte...
  • 18 篇 department of co...
  • 15 篇 school of comput...
  • 15 篇 school of comput...
  • 12 篇 institute of com...
  • 12 篇 department of co...
  • 10 篇 nit calicut
  • 10 篇 depauw universit...
  • 10 篇 national institu...
  • 9 篇 school of comput...
  • 8 篇 college of compu...
  • 7 篇 school of comput...
  • 7 篇 school of comput...
  • 6 篇 university of lo...
  • 6 篇 pablo de olavide...
  • 6 篇 department of co...
  • 6 篇 college of compu...
  • 6 篇 department of co...
  • 6 篇 school of comput...

作者

  • 25 篇 hong va leong
  • 18 篇 leong hong va
  • 15 篇 alvin chan
  • 12 篇 hong jiman
  • 11 篇 hung chih-cheng
  • 11 篇 chan alvin t.s.
  • 10 篇 liu ling
  • 10 篇 gloria childress...
  • 10 篇 george roussos
  • 8 篇 umesh bellur
  • 8 篇 song enmin
  • 7 篇 rajiv ramnath
  • 7 篇 pu calton
  • 7 篇 si antonio
  • 7 篇 ahamed sheikh iq...
  • 7 篇 chandran priya
  • 6 篇 federico divina
  • 6 篇 sheikh iqbal aha...
  • 6 篇 madhu kumar s.d.
  • 6 篇 raúl giráldez ro...

语言

  • 2,065 篇 英文
  • 9 篇 其他
  • 3 篇 中文
  • 2 篇 葡萄牙文
检索条件"任意字段=Applied Computing 2004 - Proceedings of the 2004 ACM Symposium on Applied Computing"
2079 条 记 录,以下是321-330 订阅
排序:
Special Track on Healthcare (HEALTH): A growing scenario for applied computing
Proceedings of the ACM Symposium on Applied Computing
收藏 引用
proceedings of the acm symposium on applied computing 2016年 4-08-April-2016卷 118-118页
作者: Laschi, Cecilia Menciassi, Arianna BioRobotics Institute Scuola Superiore Sant'Anna Pisa Italy
来源: 评论
Special track on cloud computing
Proceedings of the ACM Symposium on Applied Computing
收藏 引用
proceedings of the acm symposium on applied computing 2016年 4-08-April-2016卷 377-377页
作者: Madhu Kumar, S.D. Chandran, Priya De La Prieta, Fernando NIT Calicut India University of Salmanaca Spain
来源: 评论
Correctness Verification of Outsourced Inner Product of Vectors with Error Localization  15
Correctness Verification of Outsourced Inner Product of Vect...
收藏 引用
15th International symposium on Parallel and Distributed computing (ISPDC)
作者: Sheng, Gang Tang, Chunming Han, Hongyan Yin, Ying Guangzhou Univ Sch Math & Informat Sci Guangzhou 510006 Guangdong Peoples R China Liaocheng Univ Sch Math Sci Liaocheng 252059 Peoples R China Northeastern Univ Coll Comp Sci & Engn Shenyang 110004 Liaoning Peoples R China
Security challenges are the vital issues to be addressed in the research arena of cloud computing, among which the data security plays an important role. The technique of correctness verification enables the cloud use... 详细信息
来源: 评论
On the switch Markov chain for perfect matchings  27
On the switch Markov chain for perfect matchings
收藏 引用
27th Annual acm-SIAM symposium on Discrete Algorithms, SODA 2016
作者: Dyer, Martin Jerrum, Mark Miiller, Haiko School of Computing University of Leeds LeedsLS2 9JT United Kingdom School of Mathematical Sciences Queen Mary University of London LondonEl 4NS United Kingdom
We study a simple Markov chain, the switch chain, on the set of all perfect matchings in a bipartite graph. This Markov chain was proposed by Diaco-nis, Graham and Holmes as a possible approach to a sampling problem a... 详细信息
来源: 评论
New developments of distributed computing technologies in Moldova  7
New developments of distributed computing technologies in Mo...
收藏 引用
7th International Conference Distributed computing and Gridtechnologies in Science and Education, GRID 2016
作者: Bogatencov, P.P. Secrieru, G.V. Iliuha, N.P. Degteariov, N.V. Horos, G.A. RENAM Association 169 Stefan cel Mare bd. Chisinau2004 Moldova Institute of Mathematics and Computer Science Moldavian Academy of Sciences 5 Academiei str. Chisinau2028 Moldova
In the paper described directions of distributed, high performance computing (HPC) and other computer technologies development in Moldova. Considered research includes analysis of trends in the development of computer... 详细信息
来源: 评论
Special track on neurocomputing & deep learning and continuos-time computing (NC&DLCC)
Proceedings of the ACM Symposium on Applied Computing
收藏 引用
proceedings of the acm symposium on applied computing 2016年 4-08-April-2016卷 291-292页
作者: Laschi, Cecilia Falotico, Egidio Gewaltig, Marc-Oliver Röhrbein, Florian Levi, Paul Ulbrich, Stefan Zambrano, Davide Bohte, Sander BioRobotics Institute Scuola Superiore Sant'Anna Italy École Polytechnique Fédérale de Lausanne Switzerland Technical University of Munich Germany Research Center for Information Technology Germany Centrum Wiskunde and Informatica Netherlands
来源: 评论
A fast and simple algorithm for computing approximate euclidean minimum spanning trees  27
A fast and simple algorithm for computing approximate euclid...
收藏 引用
27th Annual acm-SIAM symposium on Discrete Algorithms, SODA 2016
作者: Arya, Sunil Mount, David M. Dept. of Computer Science and Engineering Hong Kong University of Science and Technology Hong Kong Dept. of Computer Science Inst for Advanced Computer Studies University of Maryland United States
The Euclidean minimum spanning tree (EMST) is a fundamental and widely studied structure. In the approximate version we are given an n-element point set P in Rd and an error parameter ϵ > 0, and the objective is to... 详细信息
来源: 评论
An efficient algorithm for computing high-quality paths amid polygonal obstacles  27
An efficient algorithm for computing high-quality paths amid...
收藏 引用
27th Annual acm-SIAM symposium on Discrete Algorithms, SODA 2016
作者: Agarwal, Pankaj K. Fox, Kyle Salzman, Oren Duke University DurhamNC United States Tel Aviv University Tel Aviv Israel
We study a path-planning problem amid a set 0 of obstacles in R2, in which we wish to compute a short path between two points while also maintaining a high clearance from 0;the clearance of a point is its distance fro... 详细信息
来源: 评论
Incidence geometries and the pass complexity of semi-streaming set cover  27
Incidence geometries and the pass complexity of semi-streami...
收藏 引用
27th Annual acm-SIAM symposium on Discrete Algorithms, SODA 2016
作者: Chakrabarti, Amit Wirtht, Anthony Department of Computer Science Dartmouth College United States Department of Computing and Information Systems University of Melbourne Australia
Set cover, over a universe of size n, may be modelled as a data-streaming problem, where the m sets that comprise the instance are to be read one by one. A semi-streaming algorithm is allowed only 0(npoly{logn, logm})... 详细信息
来源: 评论
Sampling on lattices with free boundary conditions using randomized extensions  27
Sampling on lattices with free boundary conditions using ran...
收藏 引用
27th Annual acm-SIAM symposium on Discrete Algorithms, SODA 2016
作者: Cannon, Sarah Randall, Dana College of Computing Georgia Institute of Technology AtlantaGA30332-0765 United States
Many statistical physics models are defined on an infinite lattice by taking appropriate limits of finite lattice regions, where a key consideration is how the boundaries are defined. For several models on planar latt... 详细信息
来源: 评论