English
Related papers

Related papers: Vertical partitioning of relational OLTP databases…

200 papers

Optimized spatial partitioning algorithms are the corner stone of many successful experimental designs and statistical methods. Of these algorithms, the Centroidal Voronoi Tessellation (CVT) is the most widely utilized. CVT based methods…

Methodology · Statistics 2017-01-20 Casey Kneale , Dominic Poerio , Karl S. Booksh

As VLSI designs grow in complexity, partitioning is widely adopted to accelerate physical design through parallel computing. However, traditional hypergraph partitioning methods often degrade in performance when applied to 2D layouts due to…

Emerging Technologies · Computer Science 2026-04-21 Chen Liu , Hongxin Kong , Lang Feng , Wenchao Qian , Wuxi Li

Particle physics experiments often require the simultaneous reconstruction of many interaction vertices. Usually, this problem is solved by ad hoc heuristic algorithms. We propose a universal approach to address the multiple vertex finding…

High Energy Physics - Experiment · Physics 2023-07-10 V. Kostyukhin , M. Keuper , I. Ibragimov , N. Owtscharenko , M. Cristinziani

Cloud computing provides a computing platform for the users to meet their demands in an efficient, cost-effective way. Virtualization technologies are used in the clouds to aid the efficient usage of hardware. Virtual machines (VMs) are…

Distributed, Parallel, and Cluster Computing · Computer Science 2010-11-24 Umesh Bellur , Chetan S Rao , Madhu Kumar SD

An on-line chain partitioning algorithm receives the points of the poset from some externally determined list. Being presented with a new point the algorithm learns the comparability status of this new point to all previously presented…

Data Structures and Algorithms · Computer Science 2018-04-06 Bartłomiej Bosek

Reinforcement Learning with Verifiable Rewards (RLVR) has emerged as a pivotal technique for enhancing the reasoning capabilities of Large Language Models (LLMs). However, the de facto practice of mainstream RL algorithms is to treat all…

Machine Learning · Computer Science 2026-05-12 Xincheng Yao , Ruoqi Li , Cheng Chen , Daoxin Zhang , Yi Wu , Yao Hu , Chongyang Zhang

Splitting methods are widely used for solving initial value problems (IVPs) due to their ability to simplify complicated evolutions into more manageable subproblems which can be solved efficiently and accurately. Traditionally, these…

Numerical Analysis · Mathematics 2024-11-15 L. M. Kreusser , H. E. Lockyer , E. H. Müller , P. Singh

Deriving a good variable selection strategy in branch-and-bound is essential for the efficiency of modern mixed-integer programming (MIP) solvers. With MIP branching data collected during the previous solution process, learning to branch…

Machine Learning · Computer Science 2022-07-29 Zeren Huang , Wenhao Chen , Weinan Zhang , Chuhan Shi , Furui Liu , Hui-Ling Zhen , Mingxuan Yuan , Jianye Hao , Yong Yu , Jun Wang

In modern distributed systems, efficient resource allocation is a vital aspect to maintain scalability, reduce operational costs, and ensure fast execution even across heterogeneous workloads. Predictive models for resource usage are…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-04-21 Jonathan Bader , Edgar Blumenthal , Marten Eckardt , Justus Krebs , Joel Witzke , Xemena Wysokinska , Haci Ismail Aslan , Odej Kao

Floor planning is an important and difficult task in architecture. When planning office buildings, rooms that belong to the same organisational unit should be placed close to each other. This leads to the following NP-hard mathematical…

Computational Geometry · Computer Science 2021-07-13 Jonathan Klawitter , Felix Klesen , Alexander Wolff

Database-backed applications are nearly ubiquitous in our daily lives. Applications that make many small accesses to the database create two challenges for developers: increased latency and wasted resources from numerous network round…

Databases · Computer Science 2012-08-02 Alvin Cheung , Owen Arden , Samuel Madden , Andrew C. Myers

Partitioning an input graph over a set of workers is a complex operation. Objectives are twofold: split the work evenly, so that every worker gets an equal share, and minimize edge cut to achieve a good work locality (i.e. workers can work…

Distributed, Parallel, and Cluster Computing · Computer Science 2013-11-28 Le Merrer Erwan , Liang Yizhong , Trédan Gilles

An algorithm for structured database searching is presented and used to solve the set partition problem. O(n) oracle calls are required in order to obtain a solution, but the probability that this solution is optimal decreases exponentially…

Quantum Physics · Physics 2007-05-23 Brian Murphy

Traditional DBMS servers are usually over-provisioned for most of their daily workloads and, because they do not show good-enough energy proportionality, waste a lot of energy while underutilized. A cluster of small (wimpy) servers, where…

Databases · Computer Science 2014-07-03 Daniel Schall , Theo Härder

In big data analysis, a simple task such as linear regression can become very challenging as the variable dimension $p$ grows. As a result, variable screening is inevitable in many scientific studies. In recent years, randomized algorithms…

Methodology · Statistics 2019-02-13 Yu-Hsiang Cheng , Tzee-Ming Huang , Su-Yun Huang

The capacitated p-center problem requires to select p facilities from a set of candidates to service a number of customers, subject to facility capacity constraints, with the aim of minimizing the maximum distance between a customer and its…

Data Structures and Algorithms · Computer Science 2018-03-14 Raphael Kramer , Manuel Iori , Thibaut Vidal

Skyline queries are one of the most widely adopted tools for Multi-Criteria Analysis, with applications covering diverse domains, including, e.g., Database Systems, Data Mining, and Decision Making. Skylines indeed offer a useful overview…

Databases · Computer Science 2024-11-25 Paolo Ciaccia , Davide Martinenghi

Recursive queries and recursive derived tables constitute an important part of the SQL standard. Their efficient processing is important for many real-life applications that rely on graph or hierarchy traversal. Position-enabled…

Databases · Computer Science 2023-08-21 Mikhail Firsov , Michael Polyntsov , Kirill Smirnov , George Chernishev

The extensive use of HPC infrastructures and frameworks for running dataintensive applications has led to a growing interest in data partitioning techniques and strategies. In fact, application performance can be heavily affected by how…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-02-02 Riccardo Cantini , Fabrizio Marozzo , Alessio Orsino , Domenico Talia , Paolo Trunfio , Rosa M. Badia , Jorge Ejarque , Fernando Vazquez

High fidelity simulation of large-sized complex networks can be realized on a distributed computing platform that leverages the combined resources of multiple processors or machines. In a discrete event driven simulation, the assignment of…

Distributed, Parallel, and Cluster Computing · Computer Science 2012-10-16 Aditya Kurve , Christopher Griffin , David J. Miller , George Kesidis
‹ Prev 1 4 5 6 7 8 10 Next ›