咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是491-500 订阅
排序:
Probabilistic output admissible set for systems with time-varying uncertainties
收藏 引用
SYSTEMS & CONTROL LETTERS 2008年 第4期57卷 315-321页
作者: Hatanaka, Takeshi Takaba, Kiyotsugu Tokyo Inst Technol Dept Mech & Control Engn Meguro Ku Tokyo 152 Japan Kyoto Univ Dept Appl Math & Phys Grad Sch Informat Sakyo Ku Kyoto 6068501 Japan
This paper considers time-varying uncertain constrained systems, and develops a method for computing a probabilistic output admissible (POA) set. This set consists of the initial states probabilistically assured to sa... 详细信息
来源: 评论
Testing whether a digraph contains H-free k-induced subgraphs
收藏 引用
THEORETICAL COMPUTER SCIENCE 2008年 第1-3期407卷 545-553页
作者: Lin, Hong-Yiu Lyuu, Yuh-Dauh Ma, Tak-Man Ti, Yen-Wu Natl Taiwan Univ Dept Comp Sci & Informat Engn Taipei 106 Taiwan MediaTek Inc Hsinchu Taiwan
A subgraph induced by k vertices is called a k-induced subgraph. We prove that determining if a digraph G contains H-free k-induced subgraphs is Omega(N-2)-evasive. Then we construct an is an element of-tester to test... 详细信息
来源: 评论
A Unified Theorem on SDP Rank Reduction
收藏 引用
MATHEMATICS OF OPERATIONS RESEARCH 2008年 第4期33卷 910-920页
作者: So, Anthony Man-Cho Ye, Yinyu Zhang, Jiawei Chinese Univ Hong Kong Dept Syst Engn & Engn Management Shatin Hong Kong Peoples R China Stanford Univ Dept Management Sci & Engn Stanford CA 94305 USA NYU Stern Sch Business Dept Informat Operat & Management Sci New York NY 10012 USA
We consider the problem of finding a low-rank approximate solution to a system of linear equations in symmetric, positive semidefinite matrices, where the approximation quality of a solution is measured by its maximum... 详细信息
来源: 评论
Research on selecting initial points for k-means clustering
Research on selecting initial points for k-means clustering
收藏 引用
7th International Conference on Machine Learning and Cybernetics
作者: Wang, Shou-Qiang Zhu, Da-Ming Shandong Univ Sch Comp Sci & Technol Jinan 250100 Peoples R China
Clustering analysis is one of the important problems in the fields of data mining and machine learning. There are many different clustering methods. Among them, k-means clustering is one of the most popular schemes ow... 详细信息
来源: 评论
A fast distributed approximation algorithm for minimum spanning trees
收藏 引用
20th International Symposium on Distributed Computing
作者: Khan, Maleq Pandurangan, Gopal Purdue Univ Dept Comp Sci W Lafayette IN 47907 USA
We present a distributed algorithm that constructs an O(log n)-approximate minimum spanning tree (MST) in any arbitrary network. This algorithm runs in time (O) over tilde (D(G)+L(G, w)) where L(G, w) is a parameter c... 详细信息
来源: 评论
randomized algorithms for robust feasibility problems with general nonconvex constraints
Randomized algorithms for robust feasibility problems with g...
收藏 引用
Annual Conference on the Society-of-Instrument-and-Control-Engineers
作者: Wada, Takayuki Fujisaki, Yasumasa Kobe Univ Grad Sch Sci & Technol Kobe Hyogo 6578501 Japan Kobe Univ Grad Sch Engn Kobe Hyogo 6578501 Japan
A class of robust feasibility problems is considered, which is to find a design variable satisfying a parameter-dependent constraint for all parameter values. A randomized algorithm for solving the problem with a gene... 详细信息
来源: 评论
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... 详细信息
来源: 评论
Distributed average consensus in sensor networks with quantized inter-sensor communication
Distributed average consensus in sensor networks with quanti...
收藏 引用
33rd IEEE International Conference on Acoustics, Speech and Signal Processing
作者: Kar, Soummya Moura, Jose M. F. Carnegie Mellon Univ Dept Elect & Comp Engn Pittsburgh PA 15213 USA
The paper studies distributed average consensus in sensor networks, when the sensors exchange quantized data at each time step. We show that randomizing the exchanged sensor data by adding a controlled amount of dithe... 详细信息
来源: 评论
Secure Communication Over Radio Channels
Secure Communication Over Radio Channels
收藏 引用
27th Annual ACM Symposium on Principles of Distributed Computing
作者: Dolev, Shlomi Gilbert, Seth Guerraoui, Rachid Newport, Calvin Ben Gurion Univ Negev IL-84105 Beer Sheva Israel EPFL IC Lausanne Switzerland MIT CSAIL Cambridge MA USA
We study the problem of secure communication in a multichannel, single-hop radio network with a malicious adversary that, call cause collisions and spoof messages. We assume no pre-shared secrets or trusted-third-part... 详细信息
来源: 评论
randomized probe selection algorithm for microarray design
收藏 引用
JOURNAL OF THEORETICAL BIOLOGY 2007年 第3期248卷 512-521页
作者: Gasieniec, Leszek Li, Cindy Y. Sant, Paul Wong, Prudence W. H. Univ Liverpool Dept Comp Sci Liverpool L69 3BX Merseyside England
DNA microarray technology, originally developed to measure the level of gene expression, has become one of the most widely used tools in genomic study. The crux of microarray design lies in how to select a unique prob... 详细信息
来源: 评论