Results 91 to 100 of about 31,241 (250)
Dimensionality reduction with subgaussian matrices: a unified theory [PDF]
, 2014 We present a theory for Euclidean dimensionality reduction with subgaussian matrices which unifies several restricted isometry property and Johnson-Lindenstrauss type results obtained earlier for specific data sets.
Dirksen, Sjoerd
core
An Improved Quasi‐Isometry Between Graphs of Bounded Cliquewidth and Graphs of Bounded Treewidth
Journal of Graph Theory, EarlyView.ABSTRACT Cliquewidth is a dense analogue of treewidth. It can be deduced from recent results by Hickingbotham [arXiv:2501.10840] and Nguyen, Scott, and Seymour [arXiv:2501.09839] that graphs of bounded cliquewidth are quasi‐isometric to graphs of bounded treewidth.
Marc Distel
wiley +1 more source
Restricted isometry properties and nonconvex compressive sensing
Inverse Problems, 2007 The recently emerged field known as compressive sensing has produced powerful results showing the ability to recover sparse signals from surprisingly few linear measurements, using l1 minimization. In previous work, numerical experiments showed that lp minimization with 0 < p < 1 recovers sparse signals from fewer linear measurements than does l1 ...
Rick Chartrand, Valentina Staneva
openaire +3 more sources
Isometric sketching of any set via the Restricted Isometry Property [PDF]
, 2015 In this paper we show that for the purposes of dimensionality reduction certain class of structured random matrices behave similarly to random Gaussian matrices. This class includes several matrices for which matrix-vector multiply can be computed in log-
Oymak, Samet +2 more
core
Edge‐Length Preserving Embeddings of Graphs Between Normed Spaces
Journal of Graph Theory, EarlyView.ABSTRACT The concept of graph embeddability, initially formalized by Belk and Connelly and later expanded by Sitharam and Willoughby, extends the question of embedding finite metric spaces into a given normed space. A finite simple graph G = ( V , E ) $G=(V,E)$ is said to be ( X , Y ) $(X,Y)$‐embeddable if any set of induced edge lengths from an ...
Sean Dewar +3 more
wiley +1 more source
Semirandom Planted Clique and the Restricted Isometry Property
2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS)22 pages, to appear FOCS ...
Błasiok, Jarosław +3 more
openaire +2 more sources
A Coarse Geometric Approach to Graph Layout Problems
Journal of Graph Theory, EarlyView.ABSTRACT We define a range of new coarse geometric invariants based on various graph–theoretic measures of complexity for finite graphs, including treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these invariants can be used to define functions which satisfy a strong monotonicity property, namely, they are ...
Wanying Huang +3 more
wiley +1 more source
IEEE AccessThe development of measurement matrices remains a pivotal focus within the domain of compressed sensing theory. This paper introduces an innovative methodology for the construction of a deterministic binary measurement matrix, harnessing the properties ...
Xuanwei Zhang, Huimin Yu
doaj +1 more source
A Note on Block-Sparse Signal Recovery with Coherent Tight Frames
Discrete Dynamics in Nature and Society, 2013 This note discusses the recovery of signals from undersampled data in the situation that such signals are nearly block sparse in terms of an overcomplete and coherent tight frame D. By introducing the notion of block D-restricted isometry property (D-RIP)
Yao Wang, Jianjun Wang, Zongben Xu
doaj +1 more source
The Restricted Isometry Property For Random Convolutions
, 2013 Publication in the conference proceedings of SampTA, Bremen, Germany ...
Krahmer, Felix +2 more
openaire +1 more source