中文
相关论文

相关论文: Toward Self-Adjusting k-ary Search Tree Networks

200 篇论文

Neural Networks and Decision Trees: two popular techniques for supervised learning that are seemingly disconnected in their formulation and optimization method, have recently been combined in a single construct. The connection pivots on…

机器学习 · 统计学 2020-02-27 Giuseppe Nuti , Lluís Antoni Jiménez Rugama , Kaspar Thommen

Distribution network reconfiguration (DNR) is a tool used by operators to balance line load flows and mitigate losses. As distributed generation and flexible load adoption increases, the impact of DNR on the security, efficiency, and…

Deep research agents, which synthesize information across diverse sources, are significantly constrained by the sequential nature of reasoning. This bottleneck results in high latency, poor runtime adaptability, and inefficient resource…

分布式、并行与集群计算 · 计算机科学 2026-03-31 Lunyiu Nie , Nedim Lipka , Ryan A. Rossi , Swarat Chaudhuri

The multi-modal nature of many vision problems calls for neural network architectures that can perform multiple tasks concurrently. Typically, such architectures have been handcrafted in the literature. However, given the size and…

计算机视觉与模式识别 · 计算机科学 2021-05-12 David Bruggemann , Menelaos Kanakis , Stamatios Georgoulis , Luc Van Gool

In this paper, we present fixed-parameter tractability algorithms for both the undirected and directed versions of the Spanning Tree Isomorphism Problem, parameterized by the size $k$ of a redundant set. A redundant set is a collection of…

数据结构与算法 · 计算机科学 2025-08-08 Fangjian Shen , Yicheng Zheng , Wushao Wen , Hankz Hankui Zhuo

We currently witness the emergence of interesting new network topologies optimized towards the traffic matrices they serve, such as demand-aware datacenter interconnects (e.g., ProjecToR) and demand-aware overlay networks (e.g., SplayNets).…

网络与互联网体系结构 · 计算机科学 2017-05-23 Chen Avin , Alexandr Hercules , Andreas Loukas , Stefan Schmid

We study how to dynamize the Trapezoidal Search Tree - a well known randomized point location structure for planar subdivisions of kinetic line segments. Our approach naturally extends incremental leaf-level insertions to recursive methods…

计算几何 · 计算机科学 2019-12-10 Milutin Brankovic , Nikola Grujic , André van Renssen , Martin P. Seybold

For each integer $k \geq 2$, we introduce a sequence of $k$-ary discrete trees constructed recursively by choosing at each step an edge uniformly among the present edges and grafting on "its middle" $k-1$ new edges. When $k=2$, this…

概率论 · 数学 2014-02-06 Bénédicte Haas , Robin Stephenson

Emerging reconfigurable optical communication technologies allow to enhance datacenter topologies with demand-aware links optimized towards traffic patterns. This paper studies the algorithmic problem of jointly optimizing topology and…

性能 · 计算机科学 2024-01-10 Wenkai Dai , Michael Dinitz , Klaus-Tycho Foerster , Long Luo , Stefan Schmid

The design of handcrafted neural networks requires a lot of time and resources. Recent techniques in Neural Architecture Search (NAS) have proven to be competitive or better than traditional handcrafted design, although they require domain…

机器学习 · 计算机科学 2021-03-17 Cat P. Le , Mohammadreza Soltani , Robert Ravier , Vahid Tarokh

Today's communication networks have stringent availability requirements and hence need to rapidly restore connectivity after failures. Modern networks thus implement various forms of fast reroute mechanisms in the data plane, to bridge the…

网络与互联网体系结构 · 计算机科学 2021-11-30 Oliver Schweiger , Klaus-Tycho Foerster , Stefan Schmid

Feature representations from pre-trained deep neural networks have been known to exhibit excellent generalization and utility across a variety of related tasks. Fine-tuning is by far the simplest and most widely used approach that seeks to…

计算机视觉与模式识别 · 计算机科学 2017-10-09 Donghyun Yoo , Haoqi Fan , Vishnu Naresh Boddeti , Kris M. Kitani

In this paper, we present a new MTL framework that searches for structures optimized for multiple tasks with diverse graph topologies and shares features among tasks. We design a restricted DAG-based central network with read-in/read-out…

计算机视觉与模式识别 · 计算机科学 2023-03-14 Wonhyeok Choi , Sunghoon Im

In the last few decades, data center architecture evolved from the traditional client-server to access-aggregation-core architectures. Recently there is a new shift in the data center architecture due to the increasing need for low latency…

网络与互联网体系结构 · 计算机科学 2020-09-21 Mujahid Sultan , Dodi Imbuido , Kam Patel , James MacDonald , Kumar Ratnam

Deep learning has triggered explosive growth in the demand for specialized hardware processors, thus motivating the development of scalable and reconfigurable computing substrates. Optical processors offer a fundamentally different…

We initiate the study of a natural and practically relevant new variant of online caching where the to-be-cached items can have dependencies. We assume that the universe is a tree T and items are tree nodes; we require that if a node v is…

数据结构与算法 · 计算机科学 2017-05-16 Marcin Bienkowski , Jan Marcinkowski , Maciej Pacut , Stefan Schmid , Aleksandra Spyra

The short-term adoption of opportunistic networks (OppNet) depends on improving the current performance of this type of network. Software-Defined Networks (SDN) architecture is used by Internet applications with high resource demand. SDN…

网络与互联网体系结构 · 计算机科学 2020-01-16 Mari Carmen de Toro , Carlos Borrego

Modern Neural Architecture Search methods have repeatedly broken state-of-the-art results for several disciplines. The super-network, a central component of many such methods, enables quick estimates of accuracy or loss statistics for any…

机器学习 · 计算机科学 2021-12-16 Kevin Alexander Laube , Andreas Zell

Resource is an important constraint when deploying Deep Neural Networks (DNNs) on mobile and edge devices. Existing works commonly adopt the cell-based search approach, which limits the flexibility of network patterns in learned cell…

机器学习 · 计算机科学 2020-03-04 Tunhou Zhang , Hsin-Pai Cheng , Zhenwen Li , Feng Yan , Chengyu Huang , Hai Li , Yiran Chen

Splay trees (Sleator and Tarjan) satisfy the so-called access lemma. Many of the nice properties of splay trees follow from it. What makes self-adjusting binary search trees (BSTs) satisfy the access lemma? After each access, self-adjusting…

数据结构与算法 · 计算机科学 2015-08-20 Parinya Chalermsook , Mayank Goswami , Laszlo Kozma , Kurt Mehlhorn , Thatchaphol Saranurak