咨询与建议

限定检索结果

文献类型

  • 157 篇 会议
  • 20 篇 期刊文献
  • 1 册 图书

馆藏范围

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

日期分布

学科分类号

  • 112 篇 工学
    • 107 篇 计算机科学与技术...
    • 18 篇 软件工程
    • 5 篇 信息与通信工程
    • 3 篇 电气工程
    • 2 篇 控制科学与工程
    • 2 篇 化学工程与技术
    • 1 篇 力学(可授工学、理...
    • 1 篇 机械工程
    • 1 篇 材料科学与工程(可...
    • 1 篇 农业工程
    • 1 篇 生物医学工程(可授...
    • 1 篇 生物工程
  • 103 篇 理学
    • 101 篇 数学
    • 9 篇 统计学(可授理学、...
    • 2 篇 物理学
    • 2 篇 化学
    • 2 篇 系统科学
    • 1 篇 生物学
  • 6 篇 管理学
    • 5 篇 管理科学与工程(可...
    • 4 篇 工商管理
    • 1 篇 图书情报与档案管...
  • 3 篇 经济学
    • 3 篇 应用经济学
  • 1 篇 农学
    • 1 篇 作物学

主题

  • 14 篇 approximation al...
  • 13 篇 algorithms
  • 9 篇 polynomial appro...
  • 4 篇 mobile agents
  • 4 篇 discrete fourier...
  • 3 篇 trees (mathemati...
  • 3 篇 graphic methods
  • 3 篇 logarithm (log)
  • 3 篇 logs
  • 3 篇 discrete mathema...
  • 2 篇 computer science
  • 2 篇 generating funct...
  • 2 篇 fourier analysis
  • 2 篇 byzantine agreem...
  • 2 篇 problem solving
  • 2 篇 average-case ana...
  • 2 篇 planted clique
  • 2 篇 probability dist...
  • 2 篇 lower bound
  • 2 篇 mixtures

机构

  • 6 篇 univ alberta dep...
  • 6 篇 rhein westfal th...
  • 4 篇 univ new mexico ...
  • 3 篇 university of wi...
  • 3 篇 univ quebec outa...
  • 3 篇 univ so calif de...
  • 3 篇 univ bristol dep...
  • 3 篇 univ bonn res in...
  • 2 篇 university of ca...
  • 2 篇 rhein westfal th...
  • 2 篇 university of ed...
  • 2 篇 department of ma...
  • 2 篇 univ bonn hausdo...
  • 2 篇 univ calif berke...
  • 2 篇 rhein westfal th...
  • 2 篇 department of co...
  • 2 篇 bar ilan univ de...
  • 2 篇 univ warwick dep...
  • 2 篇 department of co...
  • 2 篇 max planck inst ...

作者

  • 9 篇 csaba d. tóth
  • 7 篇 salavatipour moh...
  • 5 篇 adrian dumitresc...
  • 5 篇 svitkina zoya
  • 5 篇 pelc andrzej
  • 4 篇 friggstad zachar...
  • 4 篇 sanwalani vishal
  • 4 篇 king valerie
  • 4 篇 saia jared
  • 4 篇 andrzej pelc
  • 3 篇 coja-oghlan amin
  • 3 篇 kempe david
  • 3 篇 diakonikolas ili...
  • 3 篇 o'donnell ryan
  • 3 篇 englert matthias
  • 3 篇 servedio rocco a...
  • 3 篇 clifford raphael
  • 3 篇 tóth csaba d.
  • 3 篇 grohe martin
  • 2 篇 chan siu-on

语言

  • 177 篇 英文
  • 1 篇 其他
检索条件"任意字段=8th Annual ACM/SIAM Symposium on Discrete Algorithms"
178 条 记 录,以下是11-20 订阅
排序:
Band Selection Techniques using discrete Ranges and MaxPooling Operations for Hyperspectral Image Pixel Classification  22
Band Selection Techniques using Discrete Ranges and MaxPooli...
收藏 引用
37th annual acm symposium on Applied Computing
作者: Chang, Duhyeuk Lee, Jungsoo Jeong, Byunghyun Heo, Junyoung Hansung Univ Seoul South Korea
through this study, we intend to improve the utilization of hyperspectral high-capacity data feature information by reducing the dimension of neural network inputs in embedded systems. through the number of bands clus... 详细信息
来源: 评论
SIMPLE, DETERMINISTIC, CONSTANT-ROUND COLORING IN CONGESTED CLIQUE AND MPC
收藏 引用
siam JOURNAL ON COMPUTING 2021年 第5期50卷 1603-1626页
作者: Czumaj, Artur Davies, Peter Parter, Merav Univ Warwick Dept Comp Sci Coventry CV4 7AL W Midlands England Univ Warwick Ctr Discrete Math & Its Applicat Coventry CV4 7AL W Midlands England IST Austria A-3400 Klosterneuburg Austria Weizmann Inst Sci IL-7610001 Rehovot Israel
We settle the complexity of the ( increment +1)-coloring and ( increment +1)-list coloring problems in the CONGESTED CLIQUE model by presenting a simple deterministic algorithm for both problems running in a constant ... 详细信息
来源: 评论
Normalizers and permutational isomorphisms in simply-exponential time  31
Normalizers and permutational isomorphisms in simply-exponen...
收藏 引用
31st annual acm-siam symposium on discrete algorithms (SODA)
作者: Wiebking, Daniel Rhein Westfal TH Aachen Aachen Germany
We show that normalizers and permutational isomorphisms of permutation groups given by generating sets can be computed in time simply exponential in the degree of the groups. the result is obtained by exploiting canon... 详细信息
来源: 评论
the Complexity of Contracts  31
The Complexity of Contracts
收藏 引用
31st annual acm-siam symposium on discrete algorithms (SODA)
作者: Dutting, Paul Roughgarden, Tim Cohen, Inbal-Talgam London Sch Econ Dept Math Houghton St London WC2A 2AE England Columbia Univ Dept Comp Sci 500 West 120th St New York NY 10027 USA Technion Israel Inst Technol Dept Comp Sci IL-3200003 Haifa Israel
We initiate the study of computing (near-)optimal contracts in succinctly representable principal-agent settings. Here optimality means maximizing the principal's expected payoff over all incentive-compatible cont... 详细信息
来源: 评论
Cake Cutting on Graphs: A discrete and Bounded Proportional Protocol  31
Cake Cutting on Graphs: A Discrete and Bounded Proportional ...
收藏 引用
31st annual acm-siam symposium on discrete algorithms (SODA)
作者: Bei, Xiaohui Sun, Xiaoming Wu, Hao Zhang, Jialin Zhang, Zhijie Zi, Wei Nanyang Technol Univ Sch Phys & Math Sci Singapore Singapore Chinese Acad Sci Univ Chinese Acad Sci Inst Comp Technol CAS Key Lab Network Data Sci & Technol Beijing Peoples R China Univ Chinese Acad Sci Beijing Peoples R China
the classical cake cutting problem studies how to find fair allocations of a heterogeneous and divisible resource among multiple agents. Two of the most commonly studied fairness concepts in cake cutting are proportio... 详细信息
来源: 评论
Communication Complexity of discrete Fair Division  30
Communication Complexity of Discrete Fair Division
收藏 引用
30th annual acm-siam symposium on discrete algorithms (SODA)
作者: Plaut, Benjamin Roughgarden, Tim Stanford Univ Stanford CA 94305 USA
We initiate the study of the communication complexity of fair division with indivisible goods. We focus on some of the most well-studied fairness notions (envy-freeness, proportionality, and approximations thereof) an... 详细信息
来源: 评论
Zeros of Holant problems: locations and algorithms  30
Zeros of Holant problems: locations and algorithms
收藏 引用
30th annual acm-siam symposium on discrete algorithms (SODA)
作者: Guo, Heng Liao, Chao Lu, Pinyan Zhang, Chihao Univ Edinburgh Sch Informat Informat Forum Edinburgh EH8 9AB Midlothian Scotland Shanghai Jiao Tong Univ Dept Comp Sci & Engn 800 Dongchuan Rd Shanghai Peoples R China Shanghai Univ Finance & Econ ITCS 100 Wudong Rd Shanghai Peoples R China Shanghai Jiao Tong Univ John Hopcroft Ctr Comp Sci 800 Dongchuan Rd Shanghai Peoples R China
We present fully polynomial-time (deterministic or randomised) approximation schemes for Holant problems, defined by a non-negative constraint function satisfying a generalised second order recurrence modulo a couple ... 详细信息
来源: 评论
Proceedings of the annual acm-siam symposium on discrete algorithms
Proceedings of the Annual ACM-SIAM Symposium on Discrete Alg...
收藏 引用
30th annual acm-siam symposium on discrete algorithms, SODA 2019
the proceedings contain 183 papers. the topics discussed include: fine-grained complexity meets IP = PSPACE;an equivalence class for orthogonal vectors;seth-based lower bounds for subset sum and bicriteria path;fast m...
来源: 评论
Optimal Construction of Compressed Indexes for Highly Repetitive Texts  30
Optimal Construction of Compressed Indexes for Highly Repeti...
收藏 引用
30th annual acm-siam symposium on discrete algorithms (SODA)
作者: Kempa, Dominik Univ Helsinki Helsinki Inst Informat Technol HIIT Dept Comp Sci Helsinki Finland Univ Warwick Dept Comp Sci Coventry England Univ Warwick Ctr Discrete Math & its Applicat DIMAP Coventry England
We propose algorithms that, given the input string of length n over integer alphabet of size sigma, construct the Burrows{Wheeler transform (BWT), the permuted longest-common-prefix (PLCP) array, and the LZ77 parsing ... 详细信息
来源: 评论
Dimension-independent Sparse Fourier Transform  30
Dimension-independent Sparse Fourier Transform
收藏 引用
30th annual acm-siam symposium on discrete algorithms (SODA)
作者: Kapralov, Michael Velingker, Ameya Zandieh, Amir Ecole Polytech Fed Lausanne Sch Comp & Commun Sci Lausanne Switzerland Google Res Mountain View CA USA
the discrete Fourier Transform (DFT) is a fundamental computational primitive, and the fastest known algorithm for computing the DFT is the FFT (Fast Fourier Transform) algorithm. One remarkable feature of FFT is the ... 详细信息
来源: 评论