咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是461-470 订阅
排序:
THE WORST-CASE RUNNING TIME OF THE RANDOM SIMPLEX algorithm IS EXPONENTIAL IN THE HEIGHT
收藏 引用
INFORMATION PROCESSING LETTERS 1995年 第2期56卷 79-81页
作者: BRODER, AZ DYER, ME FRIEZE, AM RAGHAVAN, P UPFAL, E IBM CORP DIV RESTJ WATSON RES CTRYORKTOWN HTSNY 10598 DIGITAL EQUIPMENT CORP SYST RES CTRPALO ALTOCA 94301 UNIV LEEDS SCH COMP STUDIESLEEDS LS2 9JTW YORKSHIREENGLAND CARNEGIE MELLON UNIV DEPT MATHPITTSBURGHPA 15213 WEIZMANN INST SCI DEPT APPL MATHIL-76100 REHOVOTISRAEL IBM CORP ALMADEN RES CTRSAN JOSECA 95120
The random simplex algorithm for linear programming proceeds as follows: at each step, it moves from a vertex upsilon of the polytope to a randomly chosen neighbor of upsilon, the random choice being made from those n... 详细信息
来源: 评论
On the properties of the exceptional set for the randomized Euler and Runge-Kutta schemes
收藏 引用
ADVANCES IN COMPUTATIONAL MATHEMATICS 2023年 第2期49卷 14-14页
作者: Bochacik, Tomasz AGH Univ Sci & Technol Fac Appl Math Al A Mickiewicza 30 PL-30059 Krakow Poland
We show that the probability of the exceptional set decays exponentially for a broad class of randomized algorithms approximating solutions of ODEs, admitting a certain error decomposition. This class includes randomi... 详细信息
来源: 评论
A Missing Data Reconstruction Method Using an Accelerated Least-Squares Approximation with randomized SVD
收藏 引用
algorithmS 2022年 第6期15卷 190-190页
作者: Intawichai, Siriwan Chaturantabut, Saifon Thammasat Univ Fac Sci & Technol Dept Math & Stat Pathum Thani 12120 Thailand
An accelerated least-squares approach is introduced in this work by incorporating a greedy point selection method with randomized singular value decomposition (rSVD) to reduce the computational complexity of missing d... 详细信息
来源: 评论
A consistency theorem for randomized singular value decomposition
收藏 引用
STATISTICS & PROBABILITY LETTERS 2020年 第0期161卷 108743-000页
作者: Chen, Ting-Li Huang, Su-Yun Wang, Weichung Acad Sinica Inst Stat Sci Taipei 11529 Taiwan Natl Taiwan Univ Inst Appl Math Sci Taipei 10617 Taiwan
The singular value decomposition (SVD) and the principal component analysis are fundamental tools and probably the most popular methods for data dimension reduction. The rapid growth in the size of data matrices has l... 详细信息
来源: 评论
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... 详细信息
来源: 评论
FAST APPROXIMATION SCHEMES FOR CONVEX-PROGRAMS WITH MANY BLOCKS AND COUPLING CONSTRAINTS
收藏 引用
SIAM JOURNAL ON OPTIMIZATION 1994年 第1期4卷 86-107页
作者: GRIGORIADIS, MD KHACHIYAN, LG
This paper presents block-coordinate descent algorithms for the approximate solution of large structured convex programming problems. The constraints of such problems consist of K disjoint convex compact sets B-k call... 详细信息
来源: 评论
Equal-Subset-Sum Faster Than the Meet-in-the-Middle  27
Equal-Subset-Sum Faster Than the Meet-in-the-Middle
收藏 引用
27th Annual European Symposium on algorithms (ESA)
作者: Mucha, Marcin Nederlof, Jesper Pawlewicz, Jakub Wegrzycki, Karol Univ Warsaw Inst Informat Warsaw Poland Eindhoven Univ Technol Eindhoven Netherlands
In the Equal-Subset-Sum problem, we are given a set S of n integers and the problem is to decide if there exist two disjoint nonempty subsets A, B subset of S, whose elements sum up to the same value. The problem is N... 详细信息
来源: 评论
A Fast Approximation algorithm for the Subset-sum Problem
收藏 引用
International Transactions in Operational Research 2002年 第4期9卷 437-459页
作者: Przydatek, Bartosz Computer Science Department Carnegie Mellon University United States
The subset-sum problem (SSP) is defined as follows: given a positive integer bound and a set of n positive integers find a subset whose sum is closest to, but not greater than, the bound. We present a randomized appro... 详细信息
来源: 评论
Research on selecting initial points for k-means clustering
Research on selecting initial points for k-means clustering
收藏 引用
7th International Conference on Machine Learning and Cybernetics
作者: Wang, Shou-Qiang Zhu, Da-Ming Shandong Univ Sch Comp Sci & Technol Jinan 250100 Peoples R China
Clustering analysis is one of the important problems in the fields of data mining and machine learning. There are many different clustering methods. Among them, k-means clustering is one of the most popular schemes ow... 详细信息
来源: 评论
Brief Announcement: Locality-Based Aggregate Computation in Wireless Sensor Networks
Brief Announcement: Locality-Based Aggregate Computation in ...
收藏 引用
28th Annual ACM Symposium on Principles of Distributed Computing
作者: Chen, Jen-Yeu Pandurangan, Gopal Hu, Jianghai Natl Dong Haw Univ Hualien 974 Taiwan
We present DRR-gossip, an energy-efficient and robust aggregate computation algorithm in wireless sensor networks. We prove that the DRR-gossip algorithm requires O(n) messages and O(n(3/2)/log(1/2)n) one-hop wireless... 详细信息
来源: 评论