咨询与建议

限定检索结果

文献类型

  • 2 篇 会议
  • 1 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

  • 1 篇 理学
    • 1 篇 物理学
  • 1 篇 工学
    • 1 篇 信息与通信工程

主题

  • 3 篇 algorithms
  • 3 篇 analysis of algo...
  • 1 篇 real number
  • 1 篇 black
  • 1 篇 experiential lea...
  • 1 篇 calls
  • 1 篇 boxes
  • 1 篇 advance
  • 1 篇 buxus sempervire...
  • 1 篇 audit
  • 1 篇 negative
  • 1 篇 systems developm...
  • 1 篇 learning
  • 1 篇 power (psycholog...
  • 1 篇 approximation
  • 1 篇 computer based i...
  • 1 篇 costs
  • 1 篇 uranium
  • 1 篇 unitary
  • 1 篇 directed graphs

机构

  • 1 篇 univ waterloo de...
  • 1 篇 univ waterloo in...
  • 1 篇 st jeromes univ ...
  • 1 篇 technion-israel ...
  • 1 篇 perimeter inst t...
  • 1 篇 tti-chicago
  • 1 篇 faculty of organ...
  • 1 篇 natl sci fdn arl...
  • 1 篇 microsoft resear...

作者

  • 1 篇 dijana oreski
  • 1 篇 sivan sabato
  • 1 篇 nathan srebro
  • 1 篇 maslov d.
  • 1 篇 robert kudelic
  • 1 篇 mosca m.
  • 1 篇 sheridan l.
  • 1 篇 mario konecki
  • 1 篇 anand d. sarwate

语言

  • 3 篇 英文
检索条件"主题词=Analysis of Algorithms and Complexity"
3 条 记 录,以下是1-10 订阅
Monte-Carlo Randomized Algorithm: Empirical analysis on Real-World Information Systems
Monte-Carlo Randomized Algorithm: Empirical Analysis on Real...
收藏 引用
International Convention on Information and Communication Technology, Electronics and Microelectronics
作者: Robert Kudelic Dijana Oreski Mario Konecki Faculty of organization and informatics
Determination of development priority of information system subsystems is a problem that warrants resolution during information system development. It has been proven, previously, that this problem of information syst... 详细信息
来源: 评论
Auditing: Active Learning with Outcome-Dependent Query Costs  13
Auditing: Active Learning with Outcome-Dependent Query Costs
收藏 引用
Annual Conference on Neural Information Processing Systems
作者: Sivan Sabato Anand D. Sarwate Nathan Srebro Microsoft Research New England TTI-Chicago Technion-Israel Institute of Technology and TTI-Chicago
We propose a learning setting in which unlabeled data is free, and the cost of a label depends on its value, which is not known in advance. We study binary classification in an extreme case, where the algorithm only p... 详细信息
来源: 评论
Approximating fractional time quantum evolution
收藏 引用
JOURNAL OF PHYSICS A-MATHEMATICAL AND THEORETICAL 2009年 第18期42卷 185302 (15-185302 (15页
作者: Sheridan, L. Maslov, D. Mosca, M. Univ Waterloo Inst Quantum Comp Waterloo ON N2L 3G1 Canada Natl Sci Fdn Arlington VA 22230 USA Perimeter Inst Theoret Phys Waterloo ON N2L 2Y5 Canada St Jeromes Univ Waterloo ON N2L 3G3 Canada Univ Waterloo Dept Combinator & Optimizat Waterloo ON N2L 3G1 Canada
An algorithm is presented for approximating the arbitrary powers of a black box unitary operation, U-t, where t is a real number and U is a black box implementing an unknown unitary. The complexity of this algorithm i... 详细信息
来源: 评论