咨询与建议

限定检索结果

文献类型

  • 47 篇 期刊文献
  • 22 篇 会议
  • 1 篇 学位论文

馆藏范围

  • 70 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 58 篇 工学
    • 40 篇 计算机科学与技术...
    • 16 篇 电气工程
    • 15 篇 软件工程
    • 5 篇 控制科学与工程
    • 4 篇 信息与通信工程
    • 3 篇 电子科学与技术(可...
    • 2 篇 测绘科学与技术
    • 1 篇 力学(可授工学、理...
    • 1 篇 光学工程
    • 1 篇 矿业工程
    • 1 篇 船舶与海洋工程
    • 1 篇 核科学与技术
  • 30 篇 理学
    • 22 篇 数学
    • 7 篇 物理学
    • 3 篇 统计学(可授理学、...
    • 1 篇 生物学
  • 7 篇 医学
    • 6 篇 临床医学
    • 1 篇 特种医学
  • 7 篇 管理学
    • 7 篇 管理科学与工程(可...
  • 1 篇 经济学
  • 1 篇 文学
    • 1 篇 外国语言文学
  • 1 篇 农学

主题

  • 70 篇 robust algorithm...
  • 7 篇 computational ge...
  • 3 篇 feature extracti...
  • 2 篇 modular decompos...
  • 2 篇 plane sweep
  • 2 篇 clique width of ...
  • 2 篇 middleware cache
  • 2 篇 algorithms
  • 2 篇 network traffic
  • 2 篇 segment intersec...
  • 2 篇 optimization
  • 2 篇 bull- and chair-...
  • 2 篇 prime graphs
  • 2 篇 vertex cover
  • 2 篇 precision
  • 2 篇 dynamic data
  • 2 篇 convex hull
  • 2 篇 machine learning
  • 2 篇 maximum weight s...
  • 2 篇 mine detection

机构

  • 2 篇 wilfrid laurier ...
  • 2 篇 univ rostock fac...
  • 1 篇 inst natl rech i...
  • 1 篇 univ autonoma ba...
  • 1 篇 univ michigan an...
  • 1 篇 alan turing inst...
  • 1 篇 cuny lehman coll...
  • 1 篇 purdue univ cybe...
  • 1 篇 univ basque coun...
  • 1 篇 technion fac ind...
  • 1 篇 mt holyoke coll ...
  • 1 篇 tno institute of...
  • 1 篇 nyu courant inst...
  • 1 篇 univ newcastle u...
  • 1 篇 university of no...
  • 1 篇 univ michigan ar...
  • 1 篇 univ kent canter...
  • 1 篇 consejo nacl inv...
  • 1 篇 machine vision g...
  • 1 篇 univ camerino di...

作者

  • 3 篇 boissonnat jd
  • 2 篇 levin asaf
  • 2 篇 williams a
  • 2 篇 maksymonko g
  • 2 篇 brandstädt a
  • 2 篇 yvinec m
  • 2 篇 meyer r
  • 2 篇 abed-meraim kari...
  • 2 篇 wechsung florian
  • 2 篇 hoàng ct
  • 2 篇 pachowicz p
  • 2 篇 le vb
  • 2 篇 preparata fp
  • 2 篇 epstein leah
  • 1 篇 dratman ezequiel
  • 1 篇 sharif bs
  • 1 篇 jain lalit
  • 1 篇 sterpone l.
  • 1 篇 heckmann o
  • 1 篇 di claudio ed

语言

  • 64 篇 英文
  • 6 篇 其他
检索条件"主题词=robust algorithms"
70 条 记 录,以下是1-10 订阅
排序:
robust algorithms for preemptive scheduling on uniform machines of non-increasing job sizes
收藏 引用
INFORMATION PROCESSING LETTERS 2022年 174卷
作者: Levin, Asaf Technion Fac Ind Engn & Management IL-32000 Haifa Israel
Preemptive scheduling problems of minimizing the makespan on parallel machines are basic problems. Motivated by sensitivity analysis and online algorithms, we investigate the problem of designing robust algorithms tha... 详细信息
来源: 评论
robust algorithms for Online k-means Clustering  31
Robust Algorithms for Online k-means Clustering
收藏 引用
31st International Conference on Algorithmic Learning Theory (ALT)
作者: Bhaskara, Aditya Ruwanpathirana, Aravinda Kanchana Univ Utah Sch Comp Salt Lake City UT 84112 USA
In the online version of the classic k-means clustering problem, the points of a dataset u(1), u(2),... arrive one after another in an arbitrary order. When the algorithm sees a point, it should either add it to the s... 详细信息
来源: 评论
robust adaptive algorithms for fast principal component analysis
收藏 引用
DIGITAL SIGNAL PROCESSING 2022年 第0期127卷
作者: Bekhtaoui, Zineb Abed-Meraim, Karim Meche, Abdelkrim Univ Sci & Technol Oran Mohamed Boudiaf USTOMB Lab Signaux & Images BP 1505 Bir El Djir Oran Algeria Univ Orleans PRISME Lab Orleans France
In this paper, we investigate the robust estimation of the principal eigenvectors of multivariate observations in an adaptive scheme. Indeed, this problem known as PCA (Principal Component Analysis) has already many e... 详细信息
来源: 评论
robust algorithms for Low-Rank and Sparse Matrix Models
Robust Algorithms for Low-Rank and Sparse Matrix Models
收藏 引用
作者: Moore, Brian University of Michigan
Data in statistical signal processing problems is often inherently matrix-valued, and a natural first step in working with such data is to impose a model with structure that captures the distinctive features of the un... 详细信息
来源: 评论
robust algorithms for Preemptive Scheduling
收藏 引用
ALGORITHMICA 2014年 第1期69卷 26-57页
作者: Epstein, Leah Levin, Asaf Univ Haifa Dept Math IL-31905 Haifa Israel Technion Israel Inst Technol Fac Ind Engn & Management IL-32000 Haifa Israel
Preemptive scheduling problems on parallel machines are classic problems. Given the goal of minimizing the makespan, they are polynomially solvable even for the most general model of unrelated machines. In these probl... 详细信息
来源: 评论
Variants and objectives for ordinal scheduling
收藏 引用
CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH 2025年 1-36页
作者: Epstein, Leah Univ Haifa Fac Nat Sci Dept Math Haifa Israel
In ordinal scheduling problems, jobs are presented sorted by non-increasing sizes. However, it is not known in advance how many jobs of positive sizes will be presented, and what their exact sizes will be. This inform... 详细信息
来源: 评论
robust Subspace Tracking with Contamination Mitigation via α-Divergence  48
Robust Subspace Tracking with Contamination Mitigation via ...
收藏 引用
48th IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2023
作者: Thanh, Le Trung Rekavandi, Aref Miri Seghouane, Abd-Krim Abed-Meraim, Karim University of Orléans Orléans France Vnu University of Engineering and Technology Hanoi Viet Nam University of Melbourne Melbourne Australia
We studied the problem of robust subspace tracking (RST) in contaminated environments. Leveraging the fast approximated power iteration and α-divergence, a novel robust algorithm called αFAPI was developed for track... 详细信息
来源: 评论
Identifying outbreaks in sewer networks: An adaptive sampling scheme under network's uncertainty
收藏 引用
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA 2024年 第14期121卷 1页
作者: Baboun, Jose Beaudry, Isabelle S. Castro, Luis M. Gutierrez, Felipe Jara, Alejandro Rubioa, Benjamin Verschaea, Jose Pontificia Univ Catolica Chile Inst Math & Computat Engn Fac Matemat Santiago 7820436 Chile Pontificia Univ Catolica Chile Inst Math & Computat Engn Fac Ingn Santiago 7820436 Chile Mt Holyoke Coll Dept Math & Stat South Hadley MA 01075 USA Pontificia Univ Catolica Chile Dept Stat Santiago 7820436 Chile Pontificia Univ Catolica Chile MiDaS Ctr Discovery Struct Complex Data Santiago 7820436 Chile Pontificia Univ Catolica Chile Dept Comp Sci Santiago 7820436 Chile
Motivated by the implementation of a SARS-Cov-2 sewer surveillance system in Chile during the COVID-19 pandemic, we propose a set of mathematical and algorithmic tools that aim to identify the location of an outbreak ... 详细信息
来源: 评论
Assessment methods for inter-laboratory comparisons of the dicentric assay
收藏 引用
INTERNATIONAL JOURNAL OF RADIATION BIOLOGY 2023年 第3期99卷 431-438页
作者: Gonzalez Mesa, Jorge Ernesto Holladay, Bret Higueras, Manuel Di Giorgio, Marina Barquinero, Joan Francesc Ctr Protecc & Higiene Radiac Calle 20 4113 Havana 11400 Cuba Calif Polytech State Univ San Luis Obispo Stat Dept San Luis Obispo CA 93407 USA Univ La Rioja Sci Computat & Technol Innovat Ctr SCoTIC Logrono Spain Univ La Rioja Dept Matemat & Comp Logrono Spain Autoridad Regulatoria Nucl Buenos Aires DF Argentina Univ Autonoma Barcelona Dept Biol Anim Biol Vegetal & Ecol Barcelona Spain
Purpose To test the performance of different algorithms that can be used in inter-laboratory comparisons based on dicentric chromosome analysis, and to evaluate the impact of considering a priori values different to c... 详细信息
来源: 评论
A/B Testing and Best-arm Identification for Linear Bandits with robustness to Non-stationarity  27
A/B Testing and Best-arm Identification for Linear Bandits w...
收藏 引用
27th International Conference on Artificial Intelligence and Statistics (AISTATS)
作者: Xiong, Zhihan Camilleri, Romain Fazel, Maryam Jain, Lalit Jamieson, Kevin Univ Washington Seattle WA 98195 USA
We investigate the fixed-budget best-arm identification (BAI) problem for linear bandits in a potentially non-stationary environment. Given a finite arm set X subset of R-d, a fixed budget T, and an unpredictable sequ... 详细信息
来源: 评论