咨询与建议

限定检索结果

文献类型

  • 64 篇 期刊文献
  • 38 篇 会议
  • 1 篇 学位论文

馆藏范围

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

日期分布

学科分类号

  • 84 篇 工学
    • 76 篇 计算机科学与技术...
    • 15 篇 电气工程
    • 12 篇 软件工程
    • 9 篇 信息与通信工程
    • 1 篇 力学(可授工学、理...
    • 1 篇 控制科学与工程
  • 41 篇 理学
    • 35 篇 数学
    • 6 篇 物理学
    • 2 篇 统计学(可授理学、...
  • 3 篇 医学
    • 3 篇 临床医学
    • 1 篇 基础医学(可授医学...
  • 1 篇 管理学
    • 1 篇 管理科学与工程(可...

主题

  • 103 篇 local algorithms
  • 16 篇 distributed algo...
  • 7 篇 approximation al...
  • 6 篇 coloring
  • 5 篇 mobile robots
  • 5 篇 distributed comp...
  • 5 篇 dominating sets
  • 4 篇 pagerank
  • 3 篇 parallel algorit...
  • 3 篇 unit disk graphs
  • 3 篇 graph algorithms
  • 3 篇 random graphs
  • 3 篇 spectral graph t...
  • 3 篇 heat kernel
  • 3 篇 peer-to-peer
  • 3 篇 community detect...
  • 3 篇 geometric networ...
  • 3 篇 symmetry breakin...
  • 3 篇 sublinear algori...
  • 3 篇 lower bounds

机构

  • 4 篇 eth comp engn & ...
  • 2 篇 lakehead univ de...
  • 2 篇 paderborn univ h...
  • 2 篇 eth comp engn & ...
  • 2 篇 carleton univ sc...
  • 2 篇 cuny ny 10021 us...
  • 2 篇 univ padua padua
  • 2 篇 queens univ sch ...
  • 2 篇 ben gurion univ ...
  • 2 篇 univ paderborn c...
  • 2 篇 bogazici univ de...
  • 2 篇 mit csail cambri...
  • 2 篇 univ helsinki hi...
  • 2 篇 mit dept math ca...
  • 2 篇 polish acad sci ...
  • 2 篇 open univ israel...
  • 2 篇 univ helsinki hi...
  • 2 篇 tel aviv univ sc...
  • 2 篇 univ bordeaux la...
  • 2 篇 purdue univ dept...

作者

  • 11 篇 suomela jukka
  • 6 篇 wattenhofer roge...
  • 4 篇 degener bastian
  • 4 篇 kempkes barbara
  • 3 篇 choudhury salimu...
  • 3 篇 kuhn fabian
  • 3 篇 montanari andrea
  • 3 篇 kaasinen joel
  • 3 篇 schneider johann...
  • 3 篇 lenzen christoph
  • 3 篇 kaski petteri
  • 3 篇 der heide friedh...
  • 3 篇 polishchuk valen...
  • 3 篇 heide friedhelm ...
  • 3 篇 hirvonen juho
  • 3 篇 floreen patrik
  • 2 篇 jung daniel
  • 2 篇 gavoille cyril
  • 2 篇 fischer matthias
  • 2 篇 el alaoui ahmed

语言

  • 94 篇 英文
  • 9 篇 其他
检索条件"主题词=Local algorithms"
103 条 记 录,以下是31-40 订阅
排序:
Foundation of Reactive local Topology Control
收藏 引用
IEEE COMMUNICATIONS LETTERS 2015年 第7期19卷 1213-1216页
作者: Neumann, Florentin Frey, Hannes Univ Koblenz Landau Dept Comp Sci D-56070 Koblenz Germany
We formalize the concept reactive (aka contention-based or beaconless) topology control and its underlying problem statement. By means of message complexity, we define the classes of O(k)- and Omega(k)-reactive topolo... 详细信息
来源: 评论
local Hadwiger's Conjecture
收藏 引用
JOURNAL OF COMBINATORIAL THEORY SERIES B 2023年 第1期162卷 154-183页
作者: Moore, Benjamin Postle, Luke Turner, Lise Charles Univ Prague Comp Sci Inst Prague Czech Republic Univ Waterloo Dept Combinator & Optimizat Waterloo ON Canada
We propose local versions of Hadwiger's Conjecture, where only balls of radius & omega;(log(v(G))) around each vertex are required to be Kt-minor-free. We ask: if a graph is locally-Ktminor-free, is it t-colou... 详细信息
来源: 评论
Constructing near spanning trees with few local inspections
收藏 引用
RANDOM STRUCTURES & algorithms 2017年 第2期50卷 183-200页
作者: Levi, Reut Moshkovitz, Guy Ron, Dana Rubinfeld, Ronitt Shapira, Asaf MPI Informat D-66123 Saarbrucken Germany Tel Aviv Univ Sch Math IL-69978 Tel Aviv Israel Tel Aviv Univ Sch Elect Engn IL-69978 Tel Aviv Israel MIT CSAIL 77 Massachusetts Ave Cambridge MA 02139 USA
Constructing a spanning tree of a graph is one of the most basic tasks in graph theory. Motivated by several recent studies of local graph algorithms, we consider the following variant of this problem. Let G be a conn... 详细信息
来源: 评论
A local O(n2) Gathering Algorithm  10
A Local O(n<SUP>2</SUP>) Gathering Algorithm
收藏 引用
22nd ACM Symposium on Parallelism in algorithms and Architectures
作者: Degener, Bastian Kempkes, Barbara auf der Heide, Friedhelm Meyer Univ Gesamthsch Paderborn Dept Comp Sci Heinz Nixdorf Inst D-4790 Paderborn Germany
The gathering problem, where n autonomous robots with restricted capabilities are required to meet in a single point of the plane, is widely studied We consider the case that robots are limited to see only robots with... 详细信息
来源: 评论
An Optimal local Approximation Algorithm for Max-Min Linear Programs  09
An Optimal Local Approximation Algorithm for Max-Min Linear ...
收藏 引用
21st ACM Symposium on Parallelism in algorithms and Architectures
作者: Floreen, Patrik Kaasinen, Joel Kaski, Petteri Suomela, Jukka Univ Helsinki HIIT FI-00014 Helsinki Finland
In a max-min LP, the objective is to maximise omega subject to Ax = omega 1, and x >= 0 for nonnegative matrices A and C. We present a local algorithm (constant-time distributed algorithm) for approximating max-min... 详细信息
来源: 评论
Computing Heat Kernel Pagerank and a local Clustering Algorithm  1
收藏 引用
25th International Workshop on Combinatorial algorithms (IWOCA)
作者: Chung, Fan Simpson, Olivia Univ Calif San Diego La Jolla CA 92093 USA
Heat kernel pagerank is a variation of Personalized PageRank given in an exponential formulation. In this work, we present a sublinear time algorithm for approximating the heat kernel pagerank of a graph. The algorith... 详细信息
来源: 评论
local Planar Domination Revisited  1
收藏 引用
29th International Colloquium on Structural Information and Communication Complexity (SIROCCO)
作者: Heydt, Ozan Siebertz, Sebastian Vigny, Alexandre Univ Bremen Bremen Germany
We show how to compute an (11 + epsilon) - approximation of a minimum dominating set in a planar graph in a constant number of rounds in the local model of distributed computing. This improves on the previously best k... 详细信息
来源: 评论
A local Scalable Distributed Expectation Maximization Algorithm for Large Peer-to-Peer Networks
A Local Scalable Distributed Expectation Maximization Algori...
收藏 引用
9th IEEE International Conference on Data Mining
作者: Bhaduri, Kanishka Srivastava, Ashok N. NASA Ames Res Ctr MCT Inc MS 269-2 Moffett Field CA 94035 USA NASA Ames Res Ctr Moffett Field CA 94035 USA
This paper describes a local and distributed expectation maximization algorithm for learning parameters of Gaussian mixture models (GMM) in large peer-to-peer (P2P) environments. The algorithm can be used for a variet... 详细信息
来源: 评论
Scalable, Optimal Flow Routing in Datacenters via local Link Balancing  13
Scalable, Optimal Flow Routing in Datacenters via Local Link...
收藏 引用
ACM International Conference on Emerging Networking Experiments and Technologies (CoNEXT)
作者: Sen, Siddhartha Shue, David Ihm, Sunghwan Freedman, Michael J. Princeton Univ Princeton NJ 08544 USA
Datacenter networks should support high network utilization. Yet today's routing is typically load agnostic, so large flows can starve other flows if routed through overutilized links. Even recent proposals like c... 详细信息
来源: 评论
Brief Announcement: local Independent Set Approximation  16
Brief Announcement: Local Independent Set Approximation
收藏 引用
35th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC)
作者: Bodlaender, Marijke H. L. Halldorsson, Magnus M. Konrad, Christian Kuhn, Fabian Reykjavik Univ Sch Comp Sci ICE TCS Reykjavik Iceland Univ Freiburg Dept Comp Sci Freiburg Germany
We show that the first phase of the Linial-Saks network decomposition algorithm gives a randomized distributed O(n&#949;)-approximation algorithm for the maximum independent set problem that operates in O(1/&#... 详细信息
来源: 评论