咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是281-290 订阅
排序:
Parameterized algorithms for min-max 2-cluster editing
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2017年 第1期34卷 47-63页
作者: Chen, Li-Hsuan Wu, Bang Ye Natl Chung Cheng Univ Chiayi 621 Taiwan
For a given graph and an integer t, the Min-Max 2-Clustering problem asks if there exists a modification of a given graph into two maximal disjoint cliques by inserting or deleting edges such that the number of the ed... 详细信息
来源: 评论
Stochastic sampling for deterministic structural topology optimization with many load cases: Density-based and ground structure approaches
收藏 引用
COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING 2017年 325卷 463-487页
作者: Zhang, Xiaojia Shelly de Sturler, Eric Paulino, Glaucio H. Georgia Inst Technol Sch Civil & Environm Engn 790 Atlantic Dr Atlanta GA 30332 USA Virginia Tech Dept Math McBryde Hall225 Stanger St Blacksburg VA 24061 USA
We propose an efficient probabilistic method to solve a fully deterministic problem - we present a randomized optimization approach that drastically reduces the enormous computational cost of optimizing designs under ... 详细信息
来源: 评论
HOUSEHOLDER QR FACTORIZATION WITH RANDOMIZATION FOR COLUMN PIVOTING (HQRRP)
收藏 引用
SIAM JOURNAL ON SCIENTIFIC COMPUTING 2017年 第2期39卷 C96-C115页
作者: Martinsson, Per-Gunnar Orti, Gregorio Quintana Heavner, Nathan van de Geijn, Robert Univ Colorado Boulder Dept Appl Math Boulder CO 80309 USA Univ Jaume 1 Dept Ingn & Ciencia Comp Castellon de La Plana 12071 Spain Univ Texas Austin Dept Comp Sci Austin TX 78712 USA Univ Texas Austin Inst Computat Engn & Sci Austin TX 78712 USA
A fundamental problem when adding column pivoting to the Householder QR factorization is that only about half of the computation can be cast in terms of high performing matrix matrix multiplications, which greatly lim... 详细信息
来源: 评论
INTERPOLATIVE BUTTERFLY FACTORIZATION
收藏 引用
SIAM JOURNAL ON SCIENTIFIC COMPUTING 2017年 第2期39卷 A503-A531页
作者: Li, Yingzhou Yang, Haizhao Stanford Univ ICME Stanford CA 94305 USA Duke Univ Dept Math Durham NC 27708 USA
This paper introduces the interpolative butterfly factorization for nearly optimal implementation of several transforms in harmonic analysis, when their explicit formulas satisfy certain analytic properties and the ma... 详细信息
来源: 评论
An HSS Matrix-Inspired Butterfly-Based Direct Solver for Analyzing Scattering From Two-Dimensional Objects
收藏 引用
IEEE ANTENNAS AND WIRELESS PROPAGATION LETTERS 2017年 16卷 1179-1183页
作者: Liu, Yang Guo, Han Michielssen, Eric Univ Michigan Dept Elect Engn & Comp Sci Ann Arbor MI 48109 USA
A butterfly-based fast direct integral equation solver for analyzing high-frequency scattering from two-dimensional objects is presented. The solver leverages a randomized butterfly scheme to compress blocks correspon... 详细信息
来源: 评论
Low-rank approximation pursuit for matrix completion
收藏 引用
MECHANICAL SYSTEMS AND SIGNAL PROCESSING 2017年 95卷 77-89页
作者: Xu, An-Bao Xie, Dongxiu Hunan Univ Coll Math & Econometr Changsha 410082 Hunan Peoples R China Beijing Informat Sci & Technol Univ Sch Sci Beijing 100192 Peoples R China
We consider the matrix completion problem that aims to construct a low rank matrix X that approximates a given large matrix Y from partially known sample data in Y. In this paper we introduce an efficient greedy algor... 详细信息
来源: 评论
A POWER-OF-TWO-CHOICES UNBALANCED ALLOCATION PROCESS
收藏 引用
SIAM JOURNAL ON DISCRETE MATHEMATICS 2017年 第1期31卷 477-488页
作者: Redlich, Amanda Bowdoin Coll Dept Math Brunswick ME 04011 USA
The well-studied "power of two choices" family of algorithms creates balanced allocations of m balls into n bins by, for each ball, selecting a few bins at random and then placing the item in the least-loade... 详细信息
来源: 评论
Narrow sieves for parameterized paths and packings
收藏 引用
JOURNAL OF COMPUTER AND SYSTEM SCIENCES 2017年 87卷 119-139页
作者: Bjorklund, Andreas Husfeldt, Thore Kaski, Petteri Koivisto, Mikko Lund Univ Dept Comp Sci POB 118 SE-22100 Lund Sweden IT Univ Copenhagen DK-2300 Copenhagen Denmark Aalto Univ Dept Informat & Comp Sci HIIT POB 15400 FI-00076 Aalto Finland Univ Helsinki HIIT Dept Comp Sci POB 68 FI-00014 Helsinki Finland
We present parameterized algorithms for the k-path problem, the p-packing of q-sets problem, and the q-dimensional p-matching problem. Our algorithms solve these problems with high probability in time exponential only... 详细信息
来源: 评论
Preconditioned Data Sparsification for Big Data With Applications to PCA and K-Means
收藏 引用
IEEE TRANSACTIONS ON INFORMATION THEORY 2017年 第5期63卷 2954-2974页
作者: Pourkamali-Anaraki, Farhad Becker, Stephen Univ Colorado Dept Elect Comp & Energy Engn Boulder CO 80309 USA Univ Colorado Dept Appl Math Boulder CO 80309 USA
We analyze a compression scheme for large data sets that randomly keeps a small percentage of the components of each data sample. The benefit is that the output is a sparse matrix, and therefore, subsequent processing... 详细信息
来源: 评论
ACCURATE LOW-RANK APPROXIMATIONS VIA A FEW ITERATIONS OF ALTERNATING LEAST SQUARES
收藏 引用
SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS 2017年 第2期38卷 425-433页
作者: Szlam, Arthur Tulloch, Andrew Tygert, Mark Facebook Artificial Intelligence Res Menlo Pk CA 94025 USA
A few iterations of alternating least squares with a random starting point provably suffice to produce nearly optimal spectral- and Frobenius-norm accuracies of low-rank approximations to a matrix;iterating to converg... 详细信息
来源: 评论