咨询与建议

限定检索结果

文献类型

  • 116 篇 期刊文献
  • 64 篇 会议
  • 1 篇 学位论文

馆藏范围

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

日期分布

学科分类号

  • 140 篇 工学
    • 108 篇 计算机科学与技术...
    • 42 篇 电气工程
    • 24 篇 信息与通信工程
    • 18 篇 软件工程
    • 17 篇 控制科学与工程
    • 9 篇 机械工程
    • 5 篇 电子科学与技术(可...
    • 4 篇 仪器科学与技术
    • 3 篇 材料科学与工程(可...
    • 2 篇 交通运输工程
    • 1 篇 冶金工程
    • 1 篇 动力工程及工程热...
    • 1 篇 测绘科学与技术
    • 1 篇 航空宇航科学与技...
    • 1 篇 生物工程
  • 45 篇 理学
    • 34 篇 数学
    • 5 篇 统计学(可授理学、...
    • 4 篇 生物学
    • 3 篇 物理学
    • 3 篇 化学
    • 3 篇 系统科学
  • 42 篇 管理学
    • 37 篇 管理科学与工程(可...
    • 4 篇 工商管理
    • 3 篇 图书情报与档案管...
    • 2 篇 公共管理
  • 6 篇 经济学
    • 5 篇 应用经济学
  • 5 篇 医学
    • 2 篇 临床医学
    • 2 篇 公共卫生与预防医...
  • 1 篇 哲学
  • 1 篇 法学
    • 1 篇 法学
  • 1 篇 教育学
    • 1 篇 心理学(可授教育学...
  • 1 篇 军事学
  • 1 篇 艺术学

主题

  • 181 篇 approximate algo...
  • 9 篇 optimization
  • 8 篇 minimum enclosin...
  • 7 篇 exact algorithm
  • 5 篇 kernel methods
  • 5 篇 dynamic programm...
  • 4 篇 submodular
  • 4 篇 support vector m...
  • 4 篇 approximation al...
  • 4 篇 support vector m...
  • 3 篇 social network a...
  • 3 篇 core sets
  • 3 篇 computational ge...
  • 3 篇 social networks
  • 3 篇 betweenness cent...
  • 3 篇 heuristics
  • 3 篇 iterative learni...
  • 3 篇 directed graphs
  • 3 篇 motif discovery
  • 3 篇 optimal control

机构

  • 3 篇 zhengzhou inst a...
  • 3 篇 southwest jiaoto...
  • 3 篇 xidian univ stat...
  • 3 篇 hong kong univ s...
  • 2 篇 georgia state un...
  • 2 篇 college of infor...
  • 2 篇 department of co...
  • 2 篇 beijing normal u...
  • 2 篇 univ technol syd...
  • 2 篇 univ hong kong d...
  • 2 篇 univ paris sacla...
  • 2 篇 china jiliang un...
  • 2 篇 suny stony brook...
  • 2 篇 xidian univ sch ...
  • 2 篇 telecom paris ip...
  • 2 篇 shanghai jiao to...
  • 2 篇 univ new brunswi...
  • 2 篇 jiangxi univ fin...
  • 2 篇 beijing institut...
  • 2 篇 xidian univ sch ...

作者

  • 4 篇 zheng danyang
  • 4 篇 bifet albert
  • 4 篇 abdessalem talel
  • 4 篇 wang yongqing
  • 4 篇 wang meng
  • 4 篇 cui jiangtao
  • 4 篇 li hui
  • 4 篇 chehreghani most...
  • 4 篇 cao xiaojun
  • 3 篇 chen lei
  • 3 篇 xu hong-wei
  • 2 篇 liu bo
  • 2 篇 yongqing wang
  • 2 篇 zhang xudong
  • 2 篇 li dan
  • 2 篇 soh sieteng
  • 2 篇 liu xiaorong
  • 2 篇 chang liang
  • 2 篇 guoren wang
  • 2 篇 liu lei

语言

  • 171 篇 英文
  • 9 篇 其他
  • 1 篇 德文
  • 1 篇 法文
  • 1 篇 意大利文
  • 1 篇 中文
检索条件"主题词=approximate algorithm"
181 条 记 录,以下是141-150 订阅
排序:
Task Allocation in Dependency-aware Spatial Crowdsourcing  36
Task Allocation in Dependency-aware Spatial Crowdsourcing
收藏 引用
IEEE 36th International Conference on Data Engineering (ICDE)
作者: Ni, Wangze Cheng, Peng Chen, Lei Lin, Xuemin Hong Kong Univ Sci & Technol Hong Kong Peoples R China East China Normal Univ Shanghai Peoples R China Univ New South Wales Sydney NSW Australia
Ubiquitous smart devices and high-quality wireless networks enable people to participate in spatial crowdsourcing tasks easily, which require workers to physically move to specific locations to conduct their assigned ... 详细信息
来源: 评论
Complexity measures for matrix multiplication algorithms
收藏 引用
Calcolo 1980年 第1期17卷 77-86页
作者: Romani, F. Istituto di Elaborazione della Informazione CNR Pisa Italy
A new class of algorithms for the computation of bilinear forms has been recently introduced [1, 3]. These algorithms approximate the result with an arbitrarily small error. Such approximate algorithms may have a mult... 详细信息
来源: 评论
A Heuristic Method for Balanced Graph Partitioning: An Application for the Demarcation of Preventive Police Patrol Areas
收藏 引用
11th Ibero-American Conference on Artificial Intelligence
作者: Assuncao, Thiago Furtado, Vasco Univ Fortaleza Grad Program Appl Informat MIA BR-60811905 Fortaleza Ceara Brazil
In this paper we describe a heuristic method, based on graph-partitioning algorithms, with the purpose of improving the demarcation of areas for police patrolling. This demarcation seeks to homogenize the number of cr... 详细信息
来源: 评论
MCILS: Monte-Carlo Interpolation Least-Square algorithm for Approximation of Edge-Reliability Polynomial  9
MCILS: Monte-Carlo Interpolation Least-Square Algorithm for ...
收藏 引用
9th International Conference on Computer and Knowledge Engineering (ICCKE)
作者: Hadian-Rasanan, A. H. Rahmati, D. Gorgin, S. Rad, J. A. Inst Res Fundamental Sci Sch Comp Sci Farmanieh Campus Tehran Iran Shahid Beheshti Univ Fac Comp Sci & Engn Tehran Iran Iranian Res Org Sci & Technol IROST Dept Elect Engn & Informat Technol Tehran Iran Shahid Beheshti Univ Inst Cognit & Brain Sci Dept Cognit Modeling Tehran Iran
Edge reliability problem has many applications in different field of science and engineering such as: cognitive science, neuroscience, electrical engineering, network science and so on. The major challenge in this pro... 详细信息
来源: 评论
Packet Scheduling in a Low-Latency Optical Switch with Wavelength Division Multiplexing and Electronic Buffer
Packet Scheduling in a Low-Latency Optical Switch with Wavel...
收藏 引用
IEEE INFOCOM Conference
作者: Liu, Lin Zhang, Zhenghao Yang, Yuanyuan SUNY Stony Brook Dept Elect & Comp Engn Stony Brook NY 11794 USA Florida State Univ Dept Commun Sci Tallahassee 30306 FL USA
Optical switches are widely considered as the most promising candidate to provide ultra-high speed interconnections. Due to the difficulty in implementing all-optical buffer, optical switches with electronic buffers h... 详细信息
来源: 评论
Bubble Sketch: A High-performance and Memory-efficient Sketch for Finding Top-k Items in Data Streams  24
Bubble Sketch: A High-performance and Memory-efficient Sketc...
收藏 引用
33rd ACM International Conference on Information and Knowledge Management (CIKM)
作者: Cao, Lu Shi, Qilong Liu, Yuxi Zheng, Hanyue Xin, Yao Li, Wenjun Yang, Tong Wang, Yangyang Xu, Yang Zhang, Weizhe Xu, Mingwei Harbin Inst Technol Shenzhen Peoples R China Tsinghua Univ Beijing Peoples R China Pengcheng Lab Shenzhen Peoples R China Peking Univ Beijing Peoples R China Guangzhou Univ Guangzhou Peoples R China Fudan Univ Shanghai Peoples R China
Sketch algorithms are crucial for identifying top-k items in largescale data streams. Existing methods often compromise between performance and accuracy, unable to efficiently handle increasing data volumes with limit... 详细信息
来源: 评论
Distributed Triangle Counting algorithms in Simple Graph Stream  25
Distributed Triangle Counting Algorithms in Simple Graph Str...
收藏 引用
25th IEEE International Conference on Parallel and Distributed Systems (IEEE ICPADS)
作者: Yu, Mengdi Song, Chao Gu, Jiqing Liu, Ming Univ Elect Sci & Technol China Sch Comp Sci & Engn Chengdu Peoples R China Univ Elect Sci & Technol China Big Data Res Ctr Chengdu Peoples R China
Recently, the counting algorithm of local topology structures, such as triangles, has been widely used in social network analysis, recommendation systems, user portraits and other fields. At present, one-pass streamin... 详细信息
来源: 评论
Distributed Fair k-Center Clustering Problems with Outliers  22nd
Distributed Fair k-Center Clustering Problems with Outliers
收藏 引用
22nd International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2021)
作者: Yuan, Fan Diao, Luhong Du, Donglei Liu, Lei Beijing Univ Technol Dept Operat Res & Informat Engn Beijing 100124 Peoples R China Univ New Brunswick Fac Management Fredericton NB E3B 5A3 Canada
Big data clustering is a fundamental problem with a vast number of applications. Due to the increasing size of data, interests in clustering problems in distributed computation models have increased. On the other hand... 详细信息
来源: 评论
Maximizing Range Sum in Trajectory Data  38
Maximizing Range Sum in Trajectory Data
收藏 引用
38th IEEE International Conference on Data Engineering (ICDE)
作者: Zhang, Kaiqi Gao, Hong Han, Xixian Chen, Jian Li, Jianzhong Harbin Inst Technol Sch Comp Sci Harbin Peoples R China Chinese Acad Sci Shenzhen Inst Adv Technol Fac Comp Sci & Control Engn Shenzhen Peoples R China
Maximizing Range Sum (MaxRS) query is a basic operation in computational geometry and database communities. Given a set of weighted objects in 2-dimensional space and a rectangle, MaxRS query aims to find an optimal p... 详细信息
来源: 评论
Generating a simple polygonalizations
Generating a simple polygonalizations
收藏 引用
15th International Conference on Information Visualisation (IV)
作者: Muravitskiy, V. Tereshchenko, V. Natl Taras Shevchenko Univ Kiev Kiev Ukraine
We consider the methods of construction simple polygons for a set S of n points and applying them for searching the minimal area polygon. In this paper we propose the approximate algorithm, which generates the simple ... 详细信息
来源: 评论