咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是521-530 订阅
排序:
A random graph approach to NMR sequential assignment  04
A random graph approach to NMR sequential assignment
收藏 引用
8th Annual International Conference on Computational Biology (RECOMB)
作者: Bailey-Kellogg, C Chainraj, S Pandurangan, G Dartmouth Coll Dept Comp Sci Sudikoff Lab 6211 Hanover NH 03755 USA Purdue Univ Dept Comp Sci W Lafayette IN 47907 USA
Nuclear magnetic resonance (NMR) spectroscopy allows scientists to study protein structure, dynamics and interactions in solution. A necessary first step for such applications is determining the resonance assignment, ... 详细信息
来源: 评论
A Fill Estimation algorithm for Sparse Matrices and Tensors in Blocked Formats  32
A Fill Estimation Algorithm for Sparse Matrices and Tensors ...
收藏 引用
27th International Heterogeneity in Computing Workshop in conjunction with 32nd IEEE International Parallel and Distributed Processing Symposium (IPDPS)
作者: Ahrens, Willow Xu, Helen Schiefer, Nicholas MIT Comp Sci & Artificial Intelligence Lab 77 Massachusetts Ave Cambridge MA 02139 USA
Many sparse matrices and tensors from a variety of applications, such as finite element methods and computational chemistry, have a natural aligned rectangular nonzero block structure. Researchers have designed high-p... 详细信息
来源: 评论
Approximating Edit Distance Within Constant Factor in Truly Sub-Quadratic Time  59
Approximating Edit Distance Within Constant Factor in Truly ...
收藏 引用
59th IEEE Annual Symposium on Foundations of Computer Science (FOCS)
作者: Chakraborty, Diptarka Das, Debarati Goldenberg, Elazar Koucky, Michal Saks, Michael Charles Univ Prague Inst Comp Sci Malostranske Namesti 25 CR-11800 Prague 1 Czech Republic Acad Coll Tel Aviv Yaffo Sch Comp Sci Tel Aviv Israel Rutgers State Univ Dept Math Piscataway NJ USA
Edit distance is a measure of similarity of two strings based on the minimum number of character insertions, deletions, and substitutions required to transform one string into the other. The edit distance can be compu... 详细信息
来源: 评论
PHED: Pre-Handshaking Neighbor Discovery Protocols in Full Duplex Wireless Ad Hoc Networks
PHED: Pre-Handshaking Neighbor Discovery Protocols in Full D...
收藏 引用
IEEE Global Communications Conference (GLOBECOM)
作者: Sun, Guobao Wu, Fan Gao, Xiaofeng Chen, Guihai Shanghai Jiao Tong Univ Shanghai Key Lab Scalable Comp & Syst Dept Comp Sci & Engn Shanghai 200030 Peoples R China
Neighbor Discovery (ND) is a basic and crucial step for initializing wireless ad hoc networks. A fast, precise, and energy-efficient ND protocol has significant importance to subsequent operations in wireless networks... 详细信息
来源: 评论
Enabling information confidentiality in publish/subscribe overlay services
Enabling information confidentiality in publish/subscribe ov...
收藏 引用
IEEE International Conference on Communications (ICC 2008)
作者: Zhang, Hui Sharma, Abhishek Chen, Haifeng Jiang, Guofei Meng, Xiaoqiao Yoshihira, Kenji NEC Labs Amer Princeton NJ USA Univ Southern Calif Los Angeles CA USA NEC Lab Amer Princeton NJ USA
"Alice has a piece of valuable information which she is willing to sell to anyone who is interested in;she is too busy and wants to ask Bob, a professional broker, to sell that information for her;but Alice is in... 详细信息
来源: 评论
randomized estimation of functional covariance operator via subsampling
收藏 引用
STAT 2020年 第1期9卷
作者: He, Shiyuan Yan, Xiaomeng Renmin Univ China Inst Stat & Big Data 59 Zhongguancun St Beijing 100872 Peoples R China Texas A&M Univ Dept Stat College Stn TX 77843 USA
Covariance operators are fundamental concepts and modelling tools for many functional data analysis methods, such as functional principal component analysis. However, the empirical (or estimated) covariance operator b... 详细信息
来源: 评论
Faster k-SAT algorithms using Biased-PPSZ  2019
Faster k-SAT Algorithms using Biased-PPSZ
收藏 引用
51st Annual ACM SIGACT Symposium on Theory of Computing (STOC)
作者: Hansen, Thomas Dueholm Kaplan, Haim Zamir, Or Zwick, Uri Univ Copenhagen Copenhagen Denmark Tel Aviv Univ Tel Aviv Israel
The PPSZ algorithm, due to Paturi, Pudlak, Saks and Zane, is currently the fastest known algorithm for the k-SAT problem, for every k > 3. For 3-SAT, a tiny improvement over PPSZ was obtained by Hertli. We introduc... 详细信息
来源: 评论
Almost Chor-Goldreich Sources and Adversarial Random Walks  2023
Almost Chor-Goldreich Sources and Adversarial Random Walks
收藏 引用
55th Annual ACM Symposium on Theory of Computing (STOC) part of the ACM Federated Computing Research Conference (FCRC)
作者: Doron, Dean Moshkovitz, Dana Oh, Justin Zuckerman, David Ben Gurion Univ Negev Beer Sheva Israel Univ Texas Austin Austin TX USA
A Chor-Goldreich (CG) source is a sequence of random variables Chi = Chi(1) ..... -Chi(t), where each Chi(i) similar to {0, 1}(d) and Chi(i) has delta d min-entropy conditioned on any fixing of Chi = Chi(1) ..... -Chi... 详细信息
来源: 评论
Quick Detection of High-degree Entities in Large Directed Networks  14
Quick Detection of High-degree Entities in Large Directed Ne...
收藏 引用
14th IEEE International Conference on Data Mining (IEEE ICDM)
作者: Avrachenkov, K. Litvak, N. Prokhorenkova, L. Ostroumova Suyargulova, E. Inria Rocquencourt France Univ Twente NL-7500 AE Enschede Netherlands Yandex Moscow Russia
In this paper we address the problem of quick detection of high-degree entities in large online social networks. Practical importance of this problem is attested by a large number of companies that continuously collec... 详细信息
来源: 评论
Maximization of k-Submodular Function with a Matroid Constraint  17th
Maximization of k-Submodular Function with a Matroid Constra...
收藏 引用
17th Annual Conference on Theory and Applications of Models of Computation (TAMC)
作者: Sun, Yunjing Liu, Yuezhu Li, Min Shandong Normal Univ Sch Math & Stat Jinan 250014 Peoples R China
A k-submodular function is a promotion of a submodular function, whose domain is composed of k disjoint subsets rather than a single subset. In this paper, we give a deterministic algorithm for the non-monotone k-subm... 详细信息
来源: 评论