Imagen de Portada

Fast DCT+: A Family of Fast Transforms Based on Rank-One Updates of the Path Graph

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Fernández-Menduiña, Samuel, Pavez, Eduardo, Ortega, Antonio
Formato:	Preprint
Publicado:	2024
Materias:	Signal Processing Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Fast Computation of the Discrete Fourier Transform Square Index Coefficients
por: Queiroz, Saulo, et al.
Publicado: (2024)

Fast Computation of the Discrete Fourier Transform Rectangular Index Coefficients
por: Queiroz, Saulo, et al.
Publicado: (2025)

Fast Compressed-Domain N-Point Discrete Fourier Transform: The "Twiddless" FFT Algorithm
por: Queiroz, Saulo
Publicado: (2025)

FaSST: Fast Sparsifying Secondary Transform
por: Pakiyarajah, Darukeesan, et al.
Publicado: (2026)

A Dynamic Low-Rank Fast Gaussian Transform
por: Huang, Baihe, et al.
Publicado: (2022)

Feature-Preserving Rate-Distortion Optimization in Image Coding for Machines
por: Menduiña, Samuel Fernández, et al.
Publicado: (2024)

Logarithmic Positional Partition Interval Encoding
por: Alevizos, Vasileios, et al.
Publicado: (2024)

Budget Recycling Differential Privacy
por: Jiang, Bo, et al.
Publicado: (2024)

Efficient Computation of Time-Index Powered Weighted Sums Using Cascaded Accumulators
por: Linares, Deijany Rodriguez, et al.
Publicado: (2025)

Adaptive Frequency Bin Interval in FFT via Dense Sampling Factor $α$
por: Xu, Haichao
Publicado: (2024)

Fast In-Spectrum Graph Watermarks
por: Bourrée, Jade Garcia, et al.
Publicado: (2025)

Fast and Efficient Parallel Breadth-First Search with Power-law Graph Transformation
por: Jiang, Zite, et al.
Publicado: (2020)

Fully Dynamic $k$-Clustering with Fast Update Time and Small Recourse
por: Bhattacharya, Sayan, et al.
Publicado: (2024)

Fast Deterministic Chromatic Number under the Asymptotic Rank Conjecture
por: Björklund, Andreas, et al.
Publicado: (2024)

Fast Algorithms for Graph Arboricity and Related Problems
por: Cen, Ruoxu, et al.
Publicado: (2025)

The ESPRIT algorithm under high noise: Optimal error scaling and noisy super-resolution
por: Ding, Zhiyan, et al.
Publicado: (2024)

Binary Iterative Hard Thresholding Converges with Optimal Number of Measurements for 1-Bit Compressed Sensing
por: Matsumoto, Namiko, et al.
Publicado: (2022)

Exploiting Automorphisms of Temporal Graphs for Fast Exploration and Rendezvous
por: Dogeas, Konstantinos, et al.
Publicado: (2023)

Fast Sampling Based Sketches for Tensors
por: Swartworth, William, et al.
Publicado: (2024)

Tight Bounds for Online Scheduling in the One-Fast-Many-Slow Machines Setting
por: Jeang, John, et al.
Publicado: (2026)

Fast-Convergent Proximity Graphs for Approximate Nearest Neighbor Search
por: Li, Binhong, et al.
Publicado: (2025)

Faster MAX-CUT on Bounded Threshold Rank Graphs
por: Anderson, Prashanti, et al.
Publicado: (2025)

Fast and Compact Sketch-Based Dynamic Connectivity
por: De Man, Quinten, et al.
Publicado: (2025)

Fast Biclique Counting on Bipartite Graphs: A Node Pivot-based Approach
por: Ye, Xiaowei, et al.
Publicado: (2024)

A Fast Approximation Algorithm for the Minimum Balanced Vertex Separator in a Graph
por: Kolmogorov, Vladimir, et al.
Publicado: (2026)

AGIS: Fast Approximate Graph Pattern Mining with Structure-Informed Sampling
por: Lee, Seoyong, et al.
Publicado: (2026)

IBB: Fast Burrows-Wheeler Transform Construction for Length-Diverse DNA Data
por: Adler, Enno, et al.
Publicado: (2025)

Fast Similarity Sketching
por: Dahlgaard, Søren, et al.
Publicado: (2017)

Wrapper-Aware Rate-Distortion Optimization in Feature Coding for Machines
por: Fernández-Menduiña, Samuel, et al.
Publicado: (2026)

Accurate and Fast Approximate Graph Pattern Mining at Scale
por: Arpaci-Dusseau, Anna, et al.
Publicado: (2024)

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform
por: Alman, Josh, et al.
Publicado: (2025)

Fast Approximate Counting of Cycles
por: Censor-Hillel, Keren, et al.
Publicado: (2024)

SS-GUMAP, SL-GUMAP, SSSL-GUMAP: Fast UMAP Algorithms for Large Graph Drawing
por: Meidiana, Amyra, et al.
Publicado: (2025)

A Simple and Fast Algorithm for Fair Cuts
por: Li, Jason, et al.
Publicado: (2024)

Fast and Small Subsampled R-indexes
por: Cobas, Dustin, et al.
Publicado: (2024)

Fast Schulze Voting Using Quickselect
por: Arora, Arushi, et al.
Publicado: (2024)

An Improved Fully Dynamic Algorithm for Counting 4-Cycles in General Graphs using Fast Matrix Multiplication
por: Assadi, Sepehr, et al.
Publicado: (2025)

Fast and simple unrooted dynamic forests
por: Berendsohn, Benjamin Aram
Publicado: (2023)

Fast Pattern Matching with Epsilon Transitions
por: Cotumaccio, Nicola
Publicado: (2025)

Fast decremental tree sums in forests
por: Berendsohn, Benjamin Aram, et al.
Publicado: (2026)