English
Related papers

Related papers: Disassembly as Weighted Interval Scheduling with L…

200 papers

A hardware architecture for the single iteration algorithm is proposed in this paper. Single iteration algorithm enables reconstruction of the full signal when small number of signal samples is available. The algorithm is based on the…

Information Theory · Computer Science 2015-02-24 Andjela Draganic , Irena Orovic , Nedjeljko Lekic , Milos Dakovic , Srdjan Stankovic

Side-channel analysis, originally used in cryptanalysis is growing in use cases, both offensive and defensive. Wavelet analysis is a commonly employed time-frequency analysis technique used across disciplines, with a variety of purposes,…

Cryptography and Security · Computer Science 2022-04-12 Random Gwinn , Mark A. Matties , Aviel D. Rubin

Machine unlearning refers to the task of removing a subset of training data, thereby removing its contributions to a trained model. Approximate unlearning are one class of methods for this task which avoid the need to retrain the model from…

Machine Learning · Computer Science 2022-09-14 Ambrish Rawat , James Requeima , Wessel Bruinsma , Richard Turner

The prevalent technique for DNA sequencing consists of two main steps: shotgun sequencing, where many randomly located fragments, called reads, are extracted from the overall sequence, followed by an assembly algorithm that aims to…

Genomics · Quantitative Biology 2016-01-28 Shirshendu Ganguly , Elchanan Mossel , Miklos Z. Racz

Unfolding, in the context of high-energy particle physics, refers to the process of removing detector distortions in experimental data. The resulting unfolded measurements are straightforward to use for direct comparisons between…

This work introduces a novel, simple, and flexible method to quantify irreversibility in generic high-dimensional time series based on the well-known mapping to a binary classification problem. Our approach utilizes gradient boosting for…

Statistical Mechanics · Physics 2025-01-09 Michele Vodret , Cristiano Pacini , Christian Bongiorno

Decomposition, statically dividing a program into multiple units, is a common programming technique for realizing parallelism and refining programs. The decomposition of a sequential program into components is tedious, due to the…

Software Engineering · Computer Science 2020-09-09 Sabah Al-Fedaghi

In recent years, there has been an increasing demand on efficient algorithms for large scale change point detection problems. To this end, we propose seeded binary segmentation, an approach relying on a deterministic construction of…

Methodology · Statistics 2023-03-13 Solt Kovács , Housen Li , Peter Bühlmann , Axel Munk

This paper focuses on the application of soft computing in remanufacturing system, in which end-of-life products are disassembled into basic components and then remanufactured for both economic and environmental reasons. The disassembly…

Other Computer Science · Computer Science 2012-06-06 Bo Xing , Wen-Jing Gao , Fulufhelo V. Nelwamondo , Kimberly Battle , Tshilidzi Marwala

Reverse engineering tools remain monolithic and imperative compared to the advancement of modern compiler architectures: analyses are tied to a single mutable representation, making them difficult to extend or refine, and forcing premature…

Programming Languages · Computer Science 2026-03-31 Chang Liu , Yihao Sun , Thomas Gilray , Kristopher Micinski

The paper introduces a new technique for compressing Binary Decision Diagrams in those cases where random access is not required. Using this technique, compression and decompression can be done in linear time in the size of the BDD and…

Artificial Intelligence · Computer Science 2008-12-18 Esben Rune Hansen , S. Srinivasa Rao , Peter Tiedemann

The history of deep learning has shown that human-designed problem-specific networks can greatly improve the classification performance of general neural models. In most practical cases, however, choosing the optimal architecture for a…

Machine Learning · Computer Science 2020-09-14 Nicolo Colombo , Yang Gao

Finding a set of nodes in a network, whose removal fragments the network below some target size at minimal cost is called network dismantling problem and it belongs to the NP-hard computational class. In this paper, we explore the…

Social and Information Networks · Computer Science 2019-09-20 Xiao-Long Ren , Nino Antulov-Fantulin

In this paper, we present a disassemble-and-pack approach for a mechanism to seek a box which contains total mechanical parts with high space utilization. Its key feature is that mechanism contains not only geometric shapes but also…

Computational Geometry · Computer Science 2018-01-09 Mingyuan Li , Xiaoheng Jiang , Ningbo Gu , Weiwei Xu , Junxiao Xue , Bing Zhou , Mingliang Xu

The process of data analysis, especially in GUI-based analytics systems, is highly exploratory. The user iteratively refines a workflow multiple times before arriving at the final workflow. In such an exploratory setting, it is valuable to…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-08-30 Avinash Kumar , Sadeem Alsudais , Shengquan Ni , Zuozhi Wang , Yicong Huang , Chen Li

Most existing approaches to hashing apply a single form of hash function, and an optimization process which is typically deeply coupled to this specific form. This tight coupling restricts the flexibility of the method to respond to the…

Machine Learning · Computer Science 2013-09-10 Guosheng Lin , Chunhua Shen , David Suter , Anton van den Hengel

Reconstruction-based methods play an important role in unsupervised anomaly detection in images. Ideally, we expect a perfect reconstruction for normal samples and poor reconstruction for abnormal samples. Since the generalizability of deep…

Computer Vision and Pattern Recognition · Computer Science 2021-07-29 Jinlei Hou , Yingying Zhang , Qiaoyong Zhong , Di Xie , Shiliang Pu , Hong Zhou

When partitioning workflows in realistic scenarios, the knowledge of the processing units is often vague or unknown. A naive approach to addressing this issue is to perform many controlled experiments for different workloads, each…

Distributed, Parallel, and Cluster Computing · Computer Science 2015-11-03 Freddy C. Chua , Bernardo A. Huberman

Most existing learning-based methods for solving imaging inverse problems can be roughly divided into two classes: iterative algorithms, such as plug-and-play and diffusion methods leveraging pretrained denoisers, and unrolled architectures…

Image and Video Processing · Electrical Eng. & Systems 2026-03-31 Matthieu Terris , Samuel Hurault , Maxime Song , Julian Tachella

Compared to classical deep neural networks its binarized versions can be useful for applications on resource-limited devices due to their reduction in memory consumption and computational demands. In this work we study deep neural networks…

Optimization and Control · Mathematics 2021-10-26 Jannis Kurtz , Bubacarr Bah