咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是471-480 订阅
randomized DIVIDE-AND-CONQUER: IMPROVED PATH, MATCHING, AND PACKING algorithmS
收藏 引用
SIAM JOURNAL ON COMPUTING 2009年 第6期38卷 2526-2547页
作者: Chen, Jianer Kneis, Joachim Lu, Songjian Moelle, Daniel Richter, Stefan Rossmanith, Peter Sze, Sing-Hoi Zhang, Fenghui Texas A&M Univ Dept Comp Sci & Engn College Stn TX 77843 USA Rhein Westfal TH Aachen Dept Comp Sci D-52056 Aachen Germany Texas A&M Univ Dept Biochem College Stn TX 77843 USA Texas A&M Univ Dept Biophys College Stn TX 77843 USA
We propose a randomized divide-and-conquer technique that leads to improved randomized and deterministic algorithms for NP-hard PATH, MATCHING, and PACKING problems. For the parameterized max-path problem, our randomi... 详细信息
来源: 评论
TIGHT BOUNDS FOR randomized AND QUANTUM LOCAL SEARCH
收藏 引用
SIAM JOURNAL ON COMPUTING 2009年 第3期39卷 948-977页
作者: Zhang, Shengyu Chinese Univ Hong Kong Dept Comp Sci & Engn Shatin Hong Kong Peoples R China
The problem Local Search, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexity theory, and many other areas in... 详细信息
来源: 评论
Medial axis computation for planar free-form shapes
收藏 引用
COMPUTER-AIDED DESIGN 2009年 第5期41卷 339-349页
作者: Aichholzer, O. Aigner, W. Aurenhammer, F. Hackl, T. Juettler, B. Rabl, M. Johannes Kepler Univ Linz A-4040 Linz Austria Graz Univ Technol A-8010 Graz Austria
We present a simple, efficient, and stable method for computing-with any desired precision-the medial axis of simply connected planar domains. The domain boundaries are assumed to be given as polynomial spline curves.... 详细信息
来源: 评论
Improved Parameterized Set Splitting algorithms: A Probabilistic Approach
收藏 引用
algorithmICA 2009年 第4期54卷 472-489页
作者: Chen, Jianer Lu, Songjian Texas A&M Univ Dept Comp Sci College Stn TX 77843 USA
In this paper, we study parameterized algorithms for the set splitting problem, for both weighted and unweighted versions. First, we develop a new and effective technique based on a probabilistic method that allows us... 详细信息
来源: 评论
Random projections for the nonnegative least-squares problem
收藏 引用
LINEAR ALGEBRA AND ITS APPLICATIONS 2009年 第5-7期431卷 760-771页
作者: Boutsidis, Christos Drineas, Petros Rensselaer Polytech Inst Dept Comp Sci Troy NY 12180 USA
Constrained least-squares regression problems, such as the Non-negative Least Squares (NNLS) problem, where the variables are restricted to take only nonnegative values, often arise in applications. Motivated by the r... 详细信息
来源: 评论
Approximate Nearest Neighbor Search for a Dataset of Normalized Vectors
收藏 引用
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2009年 第9期E92D卷 1609-1619页
作者: Terasawa, Kengo Tanaka, Yuzuru Future Univ Hakodate Hakodate Hokkaido 3320012 Japan Japan Sci & Technol Agcy PRESTO Kawaguchi Saitama 3320012 Japan Hokkaido Univ Meme Media Lab Sapporo Hokkaido 0608628 Japan
This paper describes a novel algorithm for approximate nearest neighbor searching. For solving this problem especially in high dimensional spaces, one of the best-known algorithm is Locality-Sensitive Hashing (LSH). T... 详细信息
来源: 评论
On Counting 3-D Matchings of Size k
收藏 引用
algorithmICA 2009年 第4期54卷 530-543页
作者: Liu, Yunlong Chen, Jianer Wang, Jianxin Cent S Univ Sch Informat Sci & Engn Changsha 410083 Peoples R China Hunan Normal Univ Sch Further Educ Changsha 410012 Peoples R China Texas A&M Univ Dept Comp Sci College Stn TX 77843 USA
The computational complexity of counting the number of matchings of size k in a given triple set has been open. It is conjectured that the problem is not fixed parameter tractable. In this paper, we present a fixed pa... 详细信息
来源: 评论
Infinite-Dimensional Quadrature and Approximation of Distributions
收藏 引用
FOUNDATIONS OF COMPUTATIONAL MATHEMATICS 2009年 第4期9卷 391-429页
作者: Creutzig, Jakob Dereich, Steffen Mueller-Gronbach, Thomas Ritter, Klaus Tech Univ Berlin Fak 2 Inst Math D-10623 Berlin Germany Tech Univ Darmstadt Fachbereich Math D-64289 Darmstadt Germany Univ Magdeburg Fak Math Inst Math Stochast D-39016 Magdeburg Germany
We study numerical integration of Lipschitz functionals on a Banach space by means of deterministic and randomized (Monte Carlo) algorithms. This quadrature problem is shown to be closely related to the problem of qua... 详细信息
来源: 评论
Disjoint Bases in a Polymatroid
收藏 引用
RANDOM STRUCTURES & algorithmS 2009年 第4期35卷 418-430页
作者: Calinescu, Gruia Chekuri, Chandra Vondrak, Jan IIT Dept Comp Sci Chicago IL 60616 USA Univ Illinois Dept Comp Sci Urbana IL 61801 USA Princeton Univ Dept Math Princeton NJ 08544 USA
Let f : 2(N) -> Z(+) be a polymatroid (an integer-valued non-decreasing submodular set function with f(empty set) = 0). We call S (subset of) under bar N a base if f (S) = f (N). We consider the problern of finding... 详细信息
来源: 评论
On the chromatic number of finite systems of subsets
收藏 引用
MATHEMATICAL NOTES 2009年 第5-6期85卷 902-905页
作者: Shabanov, D. A. Moscow MV Lomonosov State Univ Moscow Russia
0
来源: 评论