咨询与建议

限定检索结果

文献类型

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

语言

  • 585 篇 英文
  • 38 篇 其他
  • 5 篇 中文
  • 1 篇 德文
检索条件"主题词=Randomized algorithm"
628 条 记 录,以下是231-240 订阅
排序:
A Novel Fiber Intrusion Signal Recognition Method for OFPS Based on SCN With Dropout
收藏 引用
JOURNAL OF LIGHTWAVE TECHNOLOGY 2019年 第20期37卷 5221-5230页
作者: Li, Wei Zeng, Zhiqiang Qu, Hongquan Sun, Chengbin North China Univ Technol Sch Informat Sci & Technol Beijing 100144 Peoples R China
Accurate and fast recognition of fiber intrusion signals has always been a fundamental task in the Optical Fiber Pre-warning System (OFPS). However, currently existing recognition models tend to focus on one aspect an... 详细信息
来源: 评论
Pass-efficient truncated UTV for low-rank approximations
收藏 引用
COMPUTATIONAL & APPLIED MATHEMATICS 2024年 第1期43卷 1-18页
作者: Ji, Ying Feng, Yuehua Dong, Yongxin Shanghai Univ Engn Sci Sch Math Phys & Stat Shanghai 201620 Peoples R China East China Univ Polit Sci & Law Sch Law & Criminal Justice Shanghai 201620 Peoples R China
We propose the pass-efficient truncated UTV algorithm, a faster variant of the TUXV algorithm for low-rank approximations. Compared with the TUXV algorithm, data transfer and the complexity of the proposed algorithm a... 详细信息
来源: 评论
A Property Tester for Tree-Likeness of Quartet Topologies
收藏 引用
THEORY OF COMPUTING SYSTEMS 2011年 第3期49卷 576-587页
作者: Chang, Maw-Shang Lin, Chuang-Chieh Rossmanith, Peter Natl Chung Cheng Univ Dept Comp Sci & Informat Engn Chiayi 621 Taiwan Rhein Westfal TH Aachen Dept Comp Sci D-52056 Aachen Germany
Property testing is a rapid growing field in theoretical computer science. It considers the following task: given a function f over a domain D, a property P and a parameter 0 0, and present the first property tester ... 详细信息
来源: 评论
ON THE POWER OF CHOICE FOR BOOLEAN FUNCTIONS
收藏 引用
SIAM JOURNAL ON DISCRETE MATHEMATICS 2022年 第3期36卷 1943-1954页
作者: Fraiman, Nicolas Lichev, Lyuben Mitsche, Dieter Univ N Carolina Chapel Hill NC 27599 USA Univ Lyon 1 Inst Camille Jordan Lyon France Univ Jean Monnet St Etienne France
In this paper we consider a variant of the well-known Achlioptas process for graphs adapted to monotone Boolean functions. Fix a number of choices r is an element of N and a sequence of increasing functions (f(n))(n &... 详细信息
来源: 评论
Memory optimal dispersion by anonymous mobile robots
收藏 引用
DISCRETE APPLIED MATHEMATICS 2023年 第1期340卷 171-182页
作者: Das, Archak Bose, Kaustav Sau, Buddhadeb Jadavpur Univ Dept Math 188 Raja SC Mallick Rd Kolkata 700032 W Bengal India Indian Stat Inst Adv Comp & Microelect Unit 203 B T Rd Kolkata 700108 W Bengal India
Consider a team of kappa <= n autonomous mobile robots initially placed at a node of an arbitrary graph G with n nodes. The dispersion problem asks for a distributed algorithm that allows the robots to reach a conf... 详细信息
来源: 评论
UTV decomposition of dual matrices and its applications
收藏 引用
COMPUTATIONAL & APPLIED MATHEMATICS 2024年 第1期43卷 1-18页
作者: Xu, Renjie Wei, Tong Wei, Yimin Yan, Hong Fudan Univ Sch Math Sci Shanghai 200433 Peoples R China Fudan Univ Inst Sci & Technol Brain Inspired Intelligence Shanghai 200433 Peoples R China Fudan Univ Sch Math Sci Shanghai Key Lab Contemporary Appl Math Shanghai 200433 Peoples R China City Univ Hong Kong Ctr Intelligent Multidimens Data Anal Dept Elect Engn Hong Kong Peoples R China
Matrix factorization in the context of dual numbers has found applications, in recent years, in fields such as kinematics and computer graphics. In this paper, we develop an efficient approach for handling large-scale... 详细信息
来源: 评论
Sequential function approximation with noisy data
收藏 引用
JOURNAL OF COMPUTATIONAL PHYSICS 2018年 371卷 363-381页
作者: Shin, Yeonjong Wu, Kailiang Xiu, Dongbin Ohio State Univ Dept Math 231 W 18th Ave Columbus OH 43210 USA
We present a sequential method for approximating an unknown function sequentially using random noisy samples. Unlike the traditional function approximation methods, the current method constructs the approximation usin... 详细信息
来源: 评论
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... 详细信息
来源: 评论
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... 详细信息
来源: 评论
A primal-dual online algorithm for the κ-server problem on weighted HSTs
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2017年 第4期34卷 1133-1146页
作者: Chen, Wenbin Li, Fufang Wang, Jianxiong Qi, Ke Tang, Maobin Wang, Xiuni Guangzhou Univ Dept Comp Sci Guangzhou Guangdong Peoples R China Guangzhou Univ Guangdong Prov Engn Technol Res Ctr Math Educ Sof Guangzhou Guangdong Peoples R China Nanjing Univ State Key Lab Novel Software Technol Nanjing Jiangsu Peoples R China
In this paper, we show that there is a 5/2 l .ln(1+ kappa)-competitive randomized algorithm for the kappa-sever problem on weighted Hierarchically Separated Trees (HSTs) with depth l when n = kappa + 1 where n is the ... 详细信息
来源: 评论