咨询与建议

限定检索结果

文献类型

  • 476 篇 期刊文献
  • 144 篇 会议
  • 5 篇 学位论文
  • 2 册 图书

馆藏范围

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

日期分布

学科分类号

  • 456 篇 工学
    • 361 篇 计算机科学与技术...
    • 116 篇 电气工程
    • 78 篇 软件工程
    • 42 篇 控制科学与工程
    • 40 篇 信息与通信工程
    • 8 篇 机械工程
    • 7 篇 电子科学与技术(可...
    • 4 篇 力学(可授工学、理...
    • 4 篇 仪器科学与技术
    • 3 篇 材料科学与工程(可...
    • 3 篇 动力工程及工程热...
    • 3 篇 石油与天然气工程
    • 3 篇 生物医学工程(可授...
    • 3 篇 生物工程
    • 3 篇 网络空间安全
    • 2 篇 测绘科学与技术
    • 2 篇 化学工程与技术
    • 2 篇 航空宇航科学与技...
  • 305 篇 理学
    • 274 篇 数学
    • 29 篇 物理学
    • 22 篇 统计学(可授理学、...
    • 8 篇 系统科学
    • 5 篇 生物学
  • 60 篇 管理学
    • 59 篇 管理科学与工程(可...
    • 12 篇 工商管理
  • 17 篇 经济学
    • 15 篇 应用经济学
    • 2 篇 理论经济学
  • 6 篇 医学
    • 5 篇 临床医学
  • 4 篇 农学
    • 2 篇 作物学
  • 3 篇 法学
    • 3 篇 法学
  • 1 篇 文学
  • 1 篇 军事学

主题

  • 627 篇 randomized algor...
  • 31 篇 approximation al...
  • 25 篇 distributed algo...
  • 19 篇 low-rank approxi...
  • 17 篇 computational ge...
  • 15 篇 approximation
  • 14 篇 lower bound
  • 13 篇 clustering
  • 12 篇 optimization
  • 11 篇 dimension reduct...
  • 11 篇 parallel algorit...
  • 10 篇 load balancing
  • 10 篇 linear programmi...
  • 10 篇 combinatorial op...
  • 9 篇 competitive anal...
  • 9 篇 singular value d...
  • 9 篇 sketching
  • 8 篇 computational co...
  • 8 篇 big data
  • 8 篇 leader election

机构

  • 11 篇 chongqing univ c...
  • 6 篇 fudan univ sch m...
  • 6 篇 stanford univ de...
  • 5 篇 univ hong kong d...
  • 5 篇 univ colorado de...
  • 5 篇 city univ hong k...
  • 5 篇 natl univ singap...
  • 4 篇 n carolina state...
  • 4 篇 wuhan univ sch m...
  • 4 篇 max planck inst ...
  • 4 篇 tsinghua univ in...
  • 4 篇 stanford univ ic...
  • 4 篇 fudan univ key l...
  • 4 篇 purdue univ dept...
  • 4 篇 univ michigan de...
  • 3 篇 univ elect sci &...
  • 3 篇 univ chicago dep...
  • 3 篇 iit dept comp sc...
  • 3 篇 xiamen univ wang...
  • 3 篇 chongqing univ k...

作者

  • 11 篇 li hanyu
  • 9 篇 pandurangan gopa...
  • 6 篇 yang haizhao
  • 6 篇 wei yimin
  • 5 篇 robinson peter
  • 5 篇 tropp joel a.
  • 5 篇 wang mengyu
  • 5 篇 kaltofen e
  • 5 篇 alipour sharareh
  • 5 篇 gulwani s
  • 5 篇 ghodsi mohammad
  • 5 篇 wang jianxin
  • 5 篇 molla anisur rah...
  • 5 篇 lau francis c. m...
  • 5 篇 necula gc
  • 5 篇 chen jianer
  • 4 篇 sauerwald thomas
  • 4 篇 kumar manish
  • 4 篇 liu yang
  • 4 篇 mostefaoui achou...

语言

  • 585 篇 英文
  • 36 篇 其他
  • 5 篇 中文
  • 1 篇 德文
检索条件"主题词=randomized algorithm"
627 条 记 录,以下是161-170 订阅
排序:
Approximate NFA universality and related problems motivated by information theory
收藏 引用
THEORETICAL COMPUTER SCIENCE 2023年 第1期972卷
作者: Konstantinidis, Stavros Mastnak, Mitja Moreira, Nelma Reis, Rogerio St Marys Univ Math & CS 923 Robie Str Halifax NS B3H 3C3 Canada Univ Porto Fac Ciencias CMUP & DM DCC Rua Campo Alegre P-4169007 Porto Portugal
In coding and information theory, it is desirable to construct maximal codes that can be either variable length codes or error control codes of fixed length. However deciding code maximality boils down to deciding whe... 详细信息
来源: 评论
Explicit error bounds for randomized Smolyak algorithms and an application to infinite-dimensional integration
收藏 引用
JOURNAL OF APPROXIMATION THEORY 2020年 251卷 105342-105342页
作者: Gnewuch, M. Wnuk, M. Univ Osnabruck Inst Math Albrechtstr 28 A D-49076 Osnabruck Germany
Smolyak's method, also known as sparse grid method, is a powerful tool to tackle multivariate tensor product problems solely with the help of efficient algorithms for the corresponding univariate problem. In this ... 详细信息
来源: 评论
Time-Optimal Construction of Overlay Networks  21
Time-Optimal Construction of Overlay Networks
收藏 引用
40th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC)
作者: Goette, Thorsten Hinnenthal, Kristian Scheideler, Christian Werthmann, Julian Paderborn Univ Paderborn Germany
We show how to construct an overlay network of constant degree and diameter O(log n) in time O(log n) starting from an arbitrary weakly connected graph. We assume a synchronous communication network in which nodes can... 详细信息
来源: 评论
Approximating 4-Cliques in Streaming Graphs: The Power of Dual Sampling  13
Approximating 4-Cliques in Streaming Graphs: The Power of Du...
收藏 引用
IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)
作者: Mann, Anmol Srinivasan, Venkatesh Thomo, Alex Univ Victoria Victoria BC Canada
Clique counting is considered to be a challenging problem in graph mining. The reason is combinatorial explosion;even moderate graphs with a few million edges could have clique counts in the order of many billions. In... 详细信息
来源: 评论
Brief Announcement: On the Message Complexity of Fault-Tolerant Computation: Leader Election and Agreement  21
Brief Announcement: On the Message Complexity of Fault-Toler...
收藏 引用
40th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC)
作者: Kumar, Manish Molla, Anisur Rahaman Indian Stat Inst Kolkata India
This paper investigates on the message complexity of the two fundamental problems, namely, leader election and agreement in the crash-fault synchronous and fully-connected distributed network. We present randomized al... 详细信息
来源: 评论
Fruit-fly Inspired Neighborhood Encoding for Classification  21
Fruit-fly Inspired Neighborhood Encoding for Classification
收藏 引用
27th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD)
作者: Sinha, Kaushik Ram, Parikshit Wichita State Univ Wichita KS 67260 USA IBM Res AI New York NY USA
Inspired by the fruit-fly olfactory circuit, the Fly Bloom Filter [4] is able to efficiently summarize the data with a single pass and has been used for novelty detection. We propose a new classifier that effectively ... 详细信息
来源: 评论
A simple randomized algorithm for two-dimensional strip packing
收藏 引用
COMPUTERS & OPERATIONS RESEARCH 2013年 第1期40卷 1-8页
作者: Yang, Shuangyuan Han, Shuihua Ye, Weiguo Xiamen Univ Software Sch Xiamen 361005 Peoples R China Xiamen Univ Dept Management Sci Xiamen 361005 Peoples R China
Two-dimensional strip packing problem is to pack given rectangular pieces on a strip of stock sheet having fixed width and infinite height. Its aim is to minimize the height of the strip such that non-guillotinable an... 详细信息
来源: 评论
A fast sketching-based algorithm for rank-(L, L, 1) block term decomposition
收藏 引用
APPLIED MATHEMATICS LETTERS 2022年 第0期133卷
作者: Zhang, Hao Huang, Ting-Zhu Zhao, Xi-Le Univ Elect Sci & Technol China Res Ctr Image & Vis Comp Sch Math Sci Chengdu Sichuan Peoples R China
The rank-(L, L, 1) block term decomposition (BTD) of the tensor has recently received increasing attention in diverse high-order data processing, e.g., hyperspectral image restoration and blind source separation. Howe... 详细信息
来源: 评论
odeN: Simultaneous Approximation of Multiple Motif Counts in Large Temporal Networks  21
odeN: Simultaneous Approximation of Multiple Motif Counts in...
收藏 引用
30th ACM International Conference on Information and Knowledge Management (CIKM)
作者: Sarpe, The Vandin, Fabio Univ Padua Dept Informat Engn Padua Italy
Counting the number of occurrences of small connected subgraphs, called temporal motifs, has become a fundamental primitive for the analysis of temporal networks, whose edges are annotated with the time of the event t... 详细信息
来源: 评论
Stable Resolving - A randomized Local Search Heuristic for MaxSAT  43rd
Stable Resolving - A Randomized Local Search Heuristic for M...
收藏 引用
43rd German Conference on Artificial Intelligence (KI)
作者: Reisch, Julian Grossmann, Peter Kliewer, Natalia Synopt GmbH Chemnitzer Str 48b D-01187 Dresden Germany Free Univ Berlin Garystr 21 D-14195 Berlin Germany
Many problems from industrial applications and AI can be encoded as Maximum Satisfiability (MaxSAT). Often, it is more desirable to produce practicable results in very short time compared to optimal solutions after an... 详细信息
来源: 评论