咨询与建议

限定检索结果

文献类型

  • 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...

语言

  • 586 篇 英文
  • 36 篇 其他
  • 5 篇 中文
  • 1 篇 德文
检索条件"主题词=Randomized algorithm"
628 条 记 录,以下是581-590 订阅
Upper and lower bounds for selection on the mesh
收藏 引用
algorithmICA 1998年 第1期20卷 1-30页
作者: Condon, A Narayanan, L CONCORDIA UNIV DEPT COMP SCIMONTREALPQ H3G 1M8CANADA
A distance-optimal algorithm for selection on the mesh has proved to be elusive, although distance-optimal algorithms for the related problems of routing and sorting have recently been discovered. In this paper we exp... 详细信息
来源: 评论
On the complexity of computing mixed volumes
收藏 引用
SIAM JOURNAL ON COMPUTING 1998年 第2期27卷 356-400页
作者: Dyer, M Gritzmann, P Hufnagel, A Univ Leeds Sch Comp Studies Leeds LS2 9JT W Yorkshire England Tech Univ Munich Ctr Math Sci D-80290 Munich Germany
This paper gives various (positive and negative) results on the complexity of the problem of computing and approximating mixed volumes of polytopes and more general convex bodies in arbitrary dimension. On the negativ... 详细信息
来源: 评论
A linear-time randomized algorithm for the bounded voronoi diagram of a simple polygon
收藏 引用
INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS 1996年 第3期6卷 263-278页
作者: Klein, R Lingas, A LUND UNIV DEPT COMP SCIS-22100 LUNDSWEDEN FERNUNIVERSITAT HAGEN D-58084 HAGENGERMANY
Far a polygon P, the bounded Voronoi diagram of P is a partition of P into regions assigned to the vertices of P. A point p inside P belongs to the region of a vertex v if and only if v is the closest vertex of P visi... 详细信息
来源: 评论
An optimal randomized parallel algorithm for the single function coarsest partition problem
收藏 引用
Parallel Processing Letters 1996年 第2期6卷 187-193页
作者: Jájá, Joseph Institute for Advanced Computer Studies Department of Electrical Engineering University of Maryland College Park MD 20742 United States
We describe a randomized parallel algorithm to solve the single function coarsest partition problem. The algorithm runs in O(log n) time using O(n) operations with high probability on the Priority CRCW PRAM. The previ... 详细信息
来源: 评论
Rounding arrangements dynamically
收藏 引用
INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS 1998年 第2期8卷 157-178页
作者: Guibas, LJ Marimont, DH Stanford Univ Dept Comp Sci Stanford CA 94305 USA Xerox Corp Palo Alto Res Ctr Palo Alto CA 94304 USA
We describe a robust, dynamic algorithm to compute the arrangement of a set of line segments in the plane, and its implementation. The algorithm is robust because, following Greene(7) and Hobby,(11) it rounds the endp... 详细信息
来源: 评论
randomized quickhull
收藏 引用
algorithmICA 1997年 第3期17卷 322-329页
作者: Wenger, R Department of Computer and Information Science The Ohio State Univeristy Columbus USA
This paper contains a simple, randomized algorithm for constructing the convex bull of a set of n points in the plane with expected running time O(n log h) where h is the number of points on the convex hull.
来源: 评论
Planar motion detection by randomized triangle matching
收藏 引用
PATTERN RECOGNITION LETTERS 1997年 第8期18卷 741-749页
作者: Fermin, I Imiya, A Chiba Univ Dept Informat & Comp Sci Inage Ku Chiba 263 Japan
This paper proposes a randomized algorithm for the estimation of the planar motion parameters of a bounded closed set. By randomly searching triangles on two shapes measured at different times, the algorithm solves th... 详细信息
来源: 评论
Tight approximations for resource constrained scheduling and bin packing
收藏 引用
DISCRETE APPLIED MATHEMATICS 1997年 第1-3期79卷 223-245页
作者: Srivastav, A Stangier, P UNIV COLOGNE ZENTRUM PARALLELES RECHNEND-50931 COLOGNEGERMANY
We consider the following resource constrained scheduling problem. We are given m identical processors, s resources R-1, ..., R-s with upper bounds b(1), ..., b(s), n independent jobs T-1, ..., T-n of unit length, whe... 详细信息
来源: 评论
Optimal, output-sensitive algorithms for constructing planar hulls in parallel
收藏 引用
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS 1997年 第3期8卷 151-166页
作者: Gupta, N Sen, S INDIAN INST TECHNOL DEPT COMP SCI & ENGNNEW DELHI 110016INDIA
In this paper we focus on the problem of designing very fast parallel algorithms for the planar convex hull problem that achieve the optimal O(n log H) work-bound for input size n and output size H. Our algorithms are... 详细信息
来源: 评论
High-performance sorting algorithms for the CRAY T3D parallel computer
收藏 引用
JOURNAL OF SUPERCOMPUTING 1997年 第4期10卷 371-395页
作者: Dixon, B Swallow, J DAVIDSON COLL DEPT MATHDAVIDSONNC 28036 CTR COMMUN RES PRINCETONNJ
In this paper we study the sorting performance of a 128-processor CRAY T3D and discuss the efficient use of the toroidal network connecting the processors. The problems we consider range from that of sorting one word ... 详细信息
来源: 评论