Results 1 - 10 of 34

Colouring Non-Sparse Random Intersection Graphs

by S. Nikoletseas, C. Raptopoulos, P. G. Spirakis
"... An intersection graph of n vertices assumes that each vertex is equipped with a subset of a global label set. Two vertices share an edge when their label sets intersect. Random Intersection Graphs (RIGs) (as defined in [18, 31]) consider label sets formed by the following experiment: each vertex, ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
is quite high (e.g. at least ln2 n m in our algorithm) and disallows direct greedy colouring methods. We manage to get the following results: – For the case mp ≤ β ln n, for any constant β < 1 − α, we prove that np colours are enough to colour most of the vertices of the graph with high probability (whp

Sparse Approximation Using M-Term Pursuits with Applications to Image and Video Compression

by Adel Rahmoune, Pierre Vandergheynst, Pascal Frossard
"... This paper introduces an algorithm for sparse approximation in redundant dictionaries, called the M-Term Pursuit (MTP), based on the matching pursuit approach (MP). This algorithm decomposes the signal into a linear combination of selected atoms, chosen to represent the signal components. The MTP al ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
This paper introduces an algorithm for sparse approximation in redundant dictionaries, called the M-Term Pursuit (MTP), based on the matching pursuit approach (MP). This algorithm decomposes the signal into a linear combination of selected atoms, chosen to represent the signal components. The MTP

Multiuser Channel Estimation: Finding the Best Sparse Representation of Crosstalk on the Basis of Overcomplete Dictionaries

by Stefano Galli, Robert Hausman, Kenneth Kerpez, Craig Valenti - in Proc. IEEE Global Telecommunications (GLOBECOM) Conf , 2002
"... An important case of multiuser channel estimation is considered here, the problem of identifying the crosstalk that disturbs a DSL signal. Crosstalk originates from signals transmitted on nearby pairs in a telephone cable, and couples over unknown pair-to-pair crosstalk coupling channels into the pa ..."
Abstract - Cited by 2 (2 self) - Add to MetaCart
Pursuit (MP) algorithm [4], a greedy algorithm for choosing a subset of vectors from an overcomplete dictionary and finding a linear combination of that subset which approximates a given signal vector. A method based on singular value decomposition (SVD) for reducing the size of the dictionary is also

Index Terms

by Siddhartha Satpathi, Mrityunjoy Chakraborty Senior Member
"... IEEE Compressive Sampling Matching Pursuit(CoSaMP) and Subspace Pursuit(SP) are popular compressive sensing greedy recovery algorithms. In this letter, we demonstrate that the CoSaMP algorithm can successfully reconstruct a K-sparse signal from a compressed measurement y = Ax by a maximum of 5K iter ..."
Abstract - Add to MetaCart
IEEE Compressive Sampling Matching Pursuit(CoSaMP) and Subspace Pursuit(SP) are popular compressive sensing greedy recovery algorithms. In this letter, we demonstrate that the CoSaMP algorithm can successfully reconstruct a K-sparse signal from a compressed measurement y = Ax by a maximum of 5K

MP3D: Highly Scalable Video Coding Scheme Based on Matching Pursuit

by Adel Rahmoune, Pierre Vandergheynst, Pascal Frossard - IN ICASSP , 2003
"... This paper describes a novel video coding scheme based on a three-dimensional Matching Pursuit algorithm. In addition to good compression performance at low bit rate, the proposed coder allows for flexible spatial, temporal and rate scalability thanks to its progressive coding structure. The Match ..."
Abstract - Cited by 4 (2 self) - Add to MetaCart
are finally arithmetic coded. A complete MP3D codec has been implemented, and performances are shown to favorably compare to other scalable coders like MPEG-4 FGS and SPIHT-3D. In addition, the MP3D streams offer an incomparable flexibility for multiresolution streaming or adaptive decoding.

M.: Irregular computations in fortran: Expression and implementation strategies. Scientific Programming 7

by Jan F Prins , Siddhartha Chatterjee , Martin Simons , 1999
"... Modern dialects of Fortran enjoy wide use and good support on high-performance computers as performance-oriented programming languages. By providing the ability to express nested data parallelism, modern Fortran dialects enable irregular computations to be incorporated into existing applications wi ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
that can improve performance and performance stability. For experimental validation of these techniques, we explore nested data-parallel implementations of the sparse matrix-vector product and the Barnes-Hut n-body algorithm by hand-coding thread-based (using OpenMP directives) and flattening

Kernel Polytope Faces Pursuit

by Tom Diethe, Zakria Hussain
"... Abstract. Polytope Faces Pursuit (PFP) is a greedy algorithm that approximates the sparse solutions recovered by ℓ1 regularised least-squares (Lasso) [4,10] in a similar vein to (Orthogonal) Matching Pursuit (OMP) [16]. The algorithm is based on the geometry of the polar polytope where at each step ..."
Abstract - Add to MetaCart
Abstract. Polytope Faces Pursuit (PFP) is a greedy algorithm that approximates the sparse solutions recovered by ℓ1 regularised least-squares (Lasso) [4,10] in a similar vein to (Orthogonal) Matching Pursuit (OMP) [16]. The algorithm is based on the geometry of the polar polytope where at each step

Tool-box for parallel adaptive computations of 3-D convection-diffusion problems using domain decomposition

by S. Z. Tomov , 2000
"... In this report we describe the tools that we have used, developed, and implemented in a computer system for simulation of flows in porous media. Our goal was to create a simulator that uses various tools and that is based on discretization by finite elements and finite volumes and uses e#cient pr ..."
Abstract - Add to MetaCart
) partitioning and load balancing software (METIS), (3) local error control and refinement procedures, (4) preconditioning methods based on domain decomposition and multigrid/multilevel, and (5) MPI and the OpenMP standards for massively parallel computations .

An Alternative Scalable Video Coding Scheme Used For Efficient Image Representation In Multimedia Applications

by Aravinda T. V, Krishna Reddy K. R
"... ------------------------------------------------------------------------------ABSTRACT----------------------------------------------------------------------This paper describes a novel video coding scheme based on a three-dimensional Matching Pursuit algorithm. In addition to good compression perfor ..."
Abstract - Add to MetaCart
map algorithm (SPPM) to form the index-map, inspired from bit plane encoding. Scalar quantization is then applied to the coefficients which are finally arithmetic coded. A completeMP3D codec has been implemented, and performances are shown to favorably compare to other scalable coders like MPEG-4 FGS

Type of suspended clay influences lake productivity and phytoplankton community response to phosphorus loading

by Benjamin E. Cuker, Phumelele T. Gama, Joann A. Burkholder - Limnol Oceanogr , 1990
"... The effects on phytoplankton and limnetics of two different types of suspended sediments and their interactions with P loading were tested in a small North Carolina Piedmont lake. Limnocorrals were used in a complete, triplicated six-treatment, blocked design. Treatments were loaded with P, kaolinit ..."
Abstract - Cited by 7 (3 self) - Add to MetaCart
, kaolinitic clay (K), K+P, montmorillonitic clay (M), and M+P. A4 caused more turbidity and stayed in suspension longer than K. Consequently, the light-dependent parameters, net community productivity (NCP), chlorophyll concentration, and algal density were lowest in the M and highest in the P treatment
Results 1 - 10 of 34