咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是591-600 订阅
Separators for sphere-packings and nearest neighbor graphs
收藏 引用
JOURNAL OF THE ACM 1997年 第1期44卷 1-29页
作者: Miller, GL Teng, SH Thurston, W Vavasis, SA UNIV MINNESOTA DEPT COMP SCIMINNEAPOLISMN 55455 UNIV CALIF BERKELEY DEPT MATHBERKELEYCA 94720 CORNELL UNIV DEPT COMP SCIITHACANY 14853
A collection of n balls in d dimensions forms a k-ply system if no point in the space is covered by more than k balls. We show that for every k-ply system Gamma, there is a sphere S that intersects at most O(k(1/d)n(1... 详细信息
来源: 评论
Mixing times for uniformly ergodic Markov chains
收藏 引用
STOCHASTIC PROCESSES AND THEIR APPLICATIONS 1997年 第2期71卷 165-185页
作者: Aldous, D Lovasz, L Winkler, P YALE UNIV DEPT COMP SCINEW HAVENCT 06510 AT&T BELL LABS MURRAY HILLNJ 07960
Consider the class of discrete time, general state space Markov chains which satisfy a ''uniform ergodicity under sampling'' condition. There are many ways to quantify the notion of ''mixing ti... 详细信息
来源: 评论
A threshold function for harmonic update
收藏 引用
SIAM JOURNAL ON DISCRETE MATHEMATICS 1997年 第3期10卷 482-498页
作者: Fang, SC Venkatesh, SS Department of Electrical Engineering University of Pennsylvania Philadelphia
Harmonic update is a randomized on-line algorithm which, given a random rn-set of vertices U(m) subset of or equal to {-1, 1}(n) in the n-dimensional cube, generates a random vertex w is an element of {-1, 1}(n) as a ... 详细信息
来源: 评论
Finding the k most vital edges with respect to minimum spanning tree
Finding the k most vital edges with respect to minimum spann...
收藏 引用
IEEE 1997 National Aerospace and Electronics Conference (NAECON 1997)
作者: Shen, H Griffith Univ Nathan Australia
For a connected, undirected and weighted graph G = (V, E), the problem of finding the k most vital edges of G with respect to minimum spanning tree is to find k edges in G whose removal will cause greatest weight incr... 详细信息
来源: 评论
Two probabilistic algorithms for planar motion detection
收藏 引用
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 1997年 第3期E80D卷 371-381页
作者: Fermin, I Imiya, A Ichikawa, A Chiba Univ Chiba-shi Japan
We introduce two probabilistic algorithms to determine the motion parameters of a planar shape without knowing a priori the point-to-point correspondences. If the target is limited to rigid objects, an Euclidean trans... 详细信息
来源: 评论
A method for obtaining randomized algorithms with small tail probabilities
收藏 引用
algorithmICA 1996年 第4-5期16卷 543-547页
作者: Alt, H Guibas, L Mehlhorn, K Karp, R Wigderson, A STANFORD UNIV STANFORDCA 94305 DIGITAL EQUIPMENT CORP SYST RES CTRPALO ALTOCA 94301 UNIV SAARLAND MAX PLANCK INST INFORMATD-6600 SAARBRUCKENGERMANY UNIV SAARLAND FACHBEREICH INFORMATD-6600 SAARBRUCKENGERMANY INT COMP SCI INST BERKELEYCA 94704 UNIV CALIF BERKELEY BERKELEYCA 94720 HEBREW UNIV JERUSALEM DEPT COMP SCIIL-91905 JERUSALEMISRAEL PRINCETON UNIV DEPT COMP SCIPRINCETONNJ 07974
We study strategies for converting randomized algorithms of the Las Vegas type into randomized algorithms with small tail probabilities.
来源: 评论
randomized polygon search for planar motion detection
收藏 引用
PATTERN RECOGNITION LETTERS 1996年 第10期17卷 1109-1115页
作者: Fermin, I Imiya, A Ichikawa, A CHIBA UNIV DEPT INFORMAT & COMP SCI INAGE KU CHIBA JAPAN
In this paper, we propose a randomized algorithm to estimate the motion parameters of a planar shape without knowing a priori the point-to-point correspondences. By randomly searching points on two shapes measured at ... 详细信息
来源: 评论
A randomized algorithm FOR K-COLORABILITY
收藏 引用
DISCRETE MATHEMATICS 1994年 第1-3期131卷 379-393页
作者: ZEROVNIK, J INST MATEMAT FIZ MEHAN LJUBLJANA 61111SLOVENIA
This note is a report of testing a straightforward generalization of the randomized 3-coloring algorithm of Petford and Welsh (1989) on the decision problems of 4- and 10-coloring. We observe similar behavior, namely ... 详细信息
来源: 评论
A new approach to the minimum cut problem
收藏 引用
JOURNAL OF THE ACM 1996年 第4期43卷 601-640页
作者: Karger, DR Stein, C DARTMOUTH COLL HANOVER NH 03755 USA
This paper presents a new approach to finding minimum cuts in undirected graphs. The fundamental principle is simple: the edges in a graph's minimum cut form an extremely small fraction of the graph's edges. U... 详细信息
来源: 评论
A randomized algorithm FOR FINDING A NEAR-MAXIMUM CLIQUE AND ITS EXPERIMENTAL EVALUATIONS
收藏 引用
SYSTEMS AND COMPUTERS IN JAPAN 1994年 第2期25卷 1-7页
作者: YAMADA, Y TOMITA, E TAKAHASHI, H UNIV ELECTROCOMMUN DEPT COMMUN & SYST ENGNCHOFUTOKYO 182JAPAN
The so-called Maximum Clique Problem is one of the most famous NP-complete problems for which it is difficult to find a solution. Given an indirected graph, we present here a polynomial-time randomized algorithm RaCLI... 详细信息
来源: 评论