咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是81-90 订阅
排序:
(1 + ε)-Approximation for Facility Location in Data Streams  13
(1 + ε)-Approximation for Facility Location in Data Streams
收藏 引用
symposium on discrete algorithms
作者: Artur Czumaj Christiane Lammersen Morteza Monemizadeh Christian Sohler Department of Computer Science and Centre for Discrete Mathematics and its Applications (DIMAP) University of Warwick School of Computing Science Simon Fraser University Institute for Computer Science University of Frankfurt Department of Computer Science Technische Universit?t Dortmund
We consider the Euclidean facility location problem with uniform opening cost. In this problem, we are given a set of n points P ? ?~2 and an opening cost f ∈ ?~+ and we want to find a set of facilities F ? ?~2 that ... 详细信息
来源: 评论
Anonymous Meeting in Networks  13
Anonymous Meeting in Networks
收藏 引用
symposium on discrete algorithms
作者: Yoann Dieudonné Andrzej Pelc MIS Université de Picardie Jules Verne Amiens France. Département d'informatique Université du Québec en Outaouais Gatineau Québec J8X 3X7 Canada.
A team consisting of an unknown number of mobile agents, starting from different nodes of an unknown network, possibly at different times, have to meet at the same node. Agents are anonymous (identical), execute the s... 详细信息
来源: 评论
Packing anchored rectangles
Packing anchored rectangles
收藏 引用
23rd annual acm-siam symposium on discrete algorithms, SODA 2012
作者: Dumitrescu, Adrian th, Csaba D. Department of Computer Science University of Wisconsin-Milwaukee Milwaukee WI United States Department of Mathematics and Statistics University of Calgary Canada
Let S be a set of n points in the unit square [0,1]2, one of which is the origin. We construct n pairwise interior-disjoint axis-aligned empty rectangles such that the lower left corner of each rectangle is a point in...
来源: 评论
the condensation transition in random hypergraph 2-coloring
The condensation transition in random hypergraph 2-coloring
收藏 引用
23rd annual acm-siam symposium on discrete algorithms, SODA 2012
作者: Coja-Oghlan, Amin Zdeborová, Lenka University of Warwick Mathematics and Computer Science Zeeman Building Coventry CV4 7AL United Kingdom Institut de Physique Théorique IPhT CNRS 91191 Gif-sur-Yvette France
For many random constraint satisfaction problems such as random satisfiability or random graph or hypergraph coloring, the best current estimates of the threshold for the existence of solutions are based on the first ... 详细信息
来源: 评论
Simultaneous approximations for adversarial and stochastic online budgeted allocation
Simultaneous approximations for adversarial and stochastic o...
收藏 引用
23rd annual acm-siam symposium on discrete algorithms, SODA 2012
作者: Mirrokni, Vahab S. Gharan, Shayan Oveis Zadimoghaddam, Morteza Google Research 76 9th Ave. New York NY 10011 United States Department of Management Science and Engineering Stanford University United States MIT Computer Science and Artificial Intelligence Laboratory Cambridge MA 02139 United States
Motivated by online ad allocation, we study the problem of simultaneous approximations for the adversarial and stochastic online budgeted allocation problem. this problem consists of a bipartite graph G = (X, Y, E), w... 详细信息
来源: 评论
Gathering despite mischief
Gathering despite mischief
收藏 引用
23rd annual acm-siam symposium on discrete algorithms, SODA 2012
作者: Dieudonné, Yoann Pelc, Andrzej Peleg, David MIS Université de Picardie Jules Verne Amiens France Département d'Informatique Université du Québec en Outaouais Gatineau QC J8X 3X7 Canada Department of Computer Science and Applied Mathematics Weizmann Institute of Science Rehovot 76100 Israel
A team consisting of an unknown number of mobile agents, starting from different nodes of an unknown network, have to meet at the same node. Agents move in synchronous rounds. Each agent has a different label. Up to f... 详细信息
来源: 评论
Computational Aesthetics 2012 - International symposium on Computational Aesthetics in Graphics, Visualization, and Imaging
Computational Aesthetics 2012 - International Symposium on C...
收藏 引用
8th annual symposium on Computational Aesthetics in Graphics, Visualization, and Imaging, CAe 2012
the proceedings contain 14 papers. the topics discussed include: SAMBA: steadied choreographies;integrarte: DigitalArt using body interaction;sketches by Paul the robot;feedback-guided stroke placement for a painting ...
来源: 评论
Random discrete colour sampling
Random discrete colour sampling
收藏 引用
8th annual symposium on Computational Aesthetics in Graphics, Visualization, and Imaging, CAe 2012
作者: Lieng, Henrik Richardt, Christian Dodgson, Neil A. University of Cambridge United Kingdom
Apparently-random distributions of colours in a discrete setting have been used by many artists and craftsmen in the past century. Manual colourisation is a tedious and difficult process. Automatic colourisation, on t... 详细信息
来源: 评论
Prize-collecting Steiner problems on planar graphs
Prize-collecting Steiner problems on planar graphs
收藏 引用
作者: Bateni, M. Chekuri, C. Ene, A. Hajiaghayi, M.T. Korula, N. Marx, D. Department of Computer Science Center for Computational Intractability Princeton University Princeton NJ 08540 United States Department of Computer Science University of Illinois Urbana IL 61801 United States Department of Computer Science University of Maryland 115 A.V. Williams Building College Park MD 20742 United States Google Research 76 9th Ave New York NY 10011 United States Humboldt-Universität zu Berlin Germany
In this paper, we reduce Prize-Collecting Steiner TSP (PCTSP), Prize-Collecting Stroll (PCS), Prize-Collecting Steiner Tree (PCST), Prize-Collecting Steiner Forest (PCSF), and more generally Submodular Prize-Collectin... 详细信息
来源: 评论
Lower-Bounded Facility Location
收藏 引用
acm TRANSACTIONS ON algorithms 2010年 第4期6卷 1–16页
作者: Svitkina, Zoya Univ Alberta Dept Comp Sci Edmonton AB T6G 2E8 Canada
We study the lower-bounded facility location problem which generalizes the classical uncapacitated facility location problem in that it comes with lower bound constraints for the number of clients assigned to a facili... 详细信息
来源: 评论