咨询与建议

限定检索结果

文献类型

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

馆藏范围

  • 628 篇 电子文献
  • 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 篇 军事学

主题

  • 628 篇 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 篇 英文
  • 38 篇 其他
  • 5 篇 中文
  • 1 篇 德文
检索条件"主题词=Randomized algorithm"
628 条 记 录,以下是531-540 订阅
排序:
Almost Chor-Goldreich Sources and Adversarial Random Walks  2023
Almost Chor-Goldreich Sources and Adversarial Random Walks
收藏 引用
55th Annual ACM Symposium on Theory of Computing (STOC) part of the ACM Federated Computing Research Conference (FCRC)
作者: Doron, Dean Moshkovitz, Dana Oh, Justin Zuckerman, David Ben Gurion Univ Negev Beer Sheva Israel Univ Texas Austin Austin TX USA
A Chor-Goldreich (CG) source is a sequence of random variables Chi = Chi(1) ..... -Chi(t), where each Chi(i) similar to {0, 1}(d) and Chi(i) has delta d min-entropy conditioned on any fixing of Chi = Chi(1) ..... -Chi... 详细信息
来源: 评论
Quick Detection of High-degree Entities in Large Directed Networks  14
Quick Detection of High-degree Entities in Large Directed Ne...
收藏 引用
14th IEEE International Conference on Data Mining (IEEE ICDM)
作者: Avrachenkov, K. Litvak, N. Prokhorenkova, L. Ostroumova Suyargulova, E. Inria Rocquencourt France Univ Twente NL-7500 AE Enschede Netherlands Yandex Moscow Russia
In this paper we address the problem of quick detection of high-degree entities in large online social networks. Practical importance of this problem is attested by a large number of companies that continuously collec... 详细信息
来源: 评论
Faster Min-Plus Product for Monotone Instances  2022
Faster Min-Plus Product for Monotone Instances
收藏 引用
54th Annual ACM SIGACT Symposium on Theory of Computing (STOC)
作者: Chi, Shucheng Duan, Ran Xie, Tianle Zhang, Tianyi Tsinghua Univ Beijing Peoples R China Tel Aviv Univ Tel Aviv Israel
In this paper, we show that the time complexity of monotone minplus product of two n x n matrices is (O) over tilde (n((3)(+omega)()/2)) = (O) over tilde (n(2.687)), where omega (n((3)(+omega)()/2)) time, which greatl... 详细信息
来源: 评论
Solving traveling salesman problem with Nested Queue-Jumping algorithm
Solving traveling salesman problem with Nested Queue-Jumping...
收藏 引用
25th International Conference on Information Technology Interfaces
作者: Zhai, DH Jin, F SW Jiaotong Univ Sch Comp & Comp Engn Chengdu 610031 Peoples R China
This paper presents a new approximate algorithm Nested Queue-Jumping algorithm (NQJA) to solve traveling salesman problem. The proposed algorithm incorporates the thoughts of heuristic algorithm, randomized algorithm ... 详细信息
来源: 评论
Almost Linear-Time algorithms for Adaptive Betweenness Centrality using Hypergraph Sketches  14
Almost Linear-Time Algorithms for Adaptive Betweenness Centr...
收藏 引用
20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD)
作者: Yoshida, Yuichi Natl Inst Informat Tokyo Japan Preferred Infrastruct Inc Tokyo Japan
Betweenness centrality measures the importance of a vertex by quantifying the number of times it acts as a midpoint of the shortest paths between other vertices. This measure is widely used in network analysis. In man... 详细信息
来源: 评论
Self-stabilization and Byzantine Tolerance for Maximal Matching  1
收藏 引用
20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)
作者: Kunne, Stephan Cohen, Johanne Pilard, Laurence Univ Paris Saclay Univ Paris Sud LRI CNRS Orsay France Univ Paris Saclay LI PaRAD Univ Versailles St Quentin Versailles France
We analyse the impact of transient and Byzantine faults on the construction of a maximal matching in a general network. We consider the self-stabilizing algorithm called AnonyMatch presented by Cohen et al. [3] for co... 详细信息
来源: 评论
Distributed average consensus in sensor networks with quantized inter-sensor communication
Distributed average consensus in sensor networks with quanti...
收藏 引用
33rd IEEE International Conference on Acoustics, Speech and Signal Processing
作者: Kar, Soummya Moura, Jose M. F. Carnegie Mellon Univ Dept Elect & Comp Engn Pittsburgh PA 15213 USA
The paper studies distributed average consensus in sensor networks, when the sensors exchange quantized data at each time step. We show that randomizing the exchanged sensor data by adding a controlled amount of dithe... 详细信息
来源: 评论
Fast Neighborhood Rendezvous  40
Fast Neighborhood Rendezvous
收藏 引用
40th IEEE International Conference on Distributed Computing Systems (ICDCS)
作者: Eguchi, Ryota Kitamura, Naoki Izumi, Taisuke Nagoya Inst Technol Dept Comp Sci Nagoya Aichi Japan
In the rendezvous problem, two computing entities (called agents) located at different vertices in a graph have to meet at the same vertex. In this paper, we consider the synchronous neighborhood rendezvous problem, w... 详细信息
来源: 评论
Partitioned Search with Column Resampling for Locating Array Construction  12
Partitioned Search with Column Resampling for Locating Array...
收藏 引用
12th IEEE International Conference on Software Testing, Verification and Validation (ICST)
作者: Lanus, Erin Colbourn, Charles J. Montgomery, Douglas C. Arizona State Univ Sch Comp Informat & Decis Syst Engn Tempe AZ 85281 USA
Locating arrays are designs used in combinatorial testing with the property that every set of d t-way interactions appears in a unique set of tests. Using a locating array to conduct fault testing ensures that faulty ... 详细信息
来源: 评论
Efficient algorithms for Graph Coloring on GPU  24
Efficient Algorithms for Graph Coloring on GPU
收藏 引用
24th IEEE International Conference on Parallel and Distributed Systems (ICPADS)
作者: Nguyen Quang Anh Pham Fan, Rui Nanyang Technol Univ Sch Comp Sci & Engn Singapore Singapore ShanghaiTech Univ Sch Informat Sci & Technol Shanghai Peoples R China
Graph coloring is an important problem in computer science and engineering with numerous applications. As the size of data increases today, graphs with millions of nodes are becoming commonplace. Parallel graph colori... 详细信息
来源: 评论