Results 261 to 270 of about 187,054 (294)
Some of the next articles are maybe not open access.
Using compression codes in compressed sensing
2016 IEEE Information Theory Workshop (ITW), 2016Data compression and compressed sensing algorithms exploit the structure present in a signal for its efficient representation and measurement, respectively. While most state-of-the-art data compression codes take advantage of complex patterns present in signals of interest, this is not the case in compressed sensing.
Farideh Ebrahim Rezagah +3 more
openaire +1 more source
Physics and Chemistry of the Earth, 1968
Methods for the determination of the density of liquids can be divided into three classes as follows. 1. Methods in which the density is measured in terms of the fundamental physical standards of measurement. 2. Methods in which it is measured relative to the density of a reference liquid or solid.
openaire +1 more source
Methods for the determination of the density of liquids can be divided into three classes as follows. 1. Methods in which the density is measured in terms of the fundamental physical standards of measurement. 2. Methods in which it is measured relative to the density of a reference liquid or solid.
openaire +1 more source
Reweighted Compressive Sampling for image compression
2009 Picture Coding Symposium, 2009Compressive Sampling (CS), is an emerging theory which points us a promising direction of designing novel efficient data compression techniques. However, the conventional CS adopts a non-discriminated sampling scheme which usually gives poor performance on realistic complex signals.
Yi Yang 0041 +4 more
openaire +1 more source
Compressible turbulent mixing: Effects of compressibility
Physical Review E, 2016We studied by numerical simulations the effects of compressibility on passive scalar transport in stationary compressible turbulence. The turbulent Mach number varied from zero to unity. The difference in driven forcing was the magnitude ratio of compressive to solenoidal modes.
openaire +2 more sources
A new compression method for compressed matching
Proceedings DCC 2000. Data Compression Conference, 2002A practical adaptive compression algorithm based on LZSS is presented, which is especially constructed to solve the compressed pattern matching problem, i.e., pattern matching directly in a compressed text without decompressing.
Shmuel T. Klein, Dana Shapira
openaire +1 more source
The Journal of the Acoustical Society of America, 2014
Sound source localization with sensor arrays involves the estimation of the direction-of-arrival (DOA) from a limited number of observations. Compressive sensing (CS) solves such underdetermined problems achieving sparsity, thus improved resolution, and can be solved efficiently with convex optimization.
Angeliki, Xenaki +2 more
openaire +2 more sources
Sound source localization with sensor arrays involves the estimation of the direction-of-arrival (DOA) from a limited number of observations. Compressive sensing (CS) solves such underdetermined problems achieving sparsity, thus improved resolution, and can be solved efficiently with convex optimization.
Angeliki, Xenaki +2 more
openaire +2 more sources
The Quarterly Journal of Mathematics, 1955
Publisher Summary The theory of obstructions to extensions of mappings has simplified and unified many results in homotopy theory. This chapter presents a dual theory in which the problem is to deform a map ( X , A ) →( Y , B ) into one with values in a subspace Y ' ( B ⊂ Y ') by a homotopy of the form ( X , A ) → ( Y , B ). This is referred to
Spanier, Edwin H., Whitehead, J. H. C.
openaire +1 more source
Publisher Summary The theory of obstructions to extensions of mappings has simplified and unified many results in homotopy theory. This chapter presents a dual theory in which the problem is to deform a map ( X , A ) →( Y , B ) into one with values in a subspace Y ' ( B ⊂ Y ') by a homotopy of the form ( X , A ) → ( Y , B ). This is referred to
Spanier, Edwin H., Whitehead, J. H. C.
openaire +1 more source
To compress or not to compress: A compressed debate
Journal of the American College of Radiology, 2004Eliot L, Siegel, Ramin, Khorasani
openaire +2 more sources
TO COMPRESS OR NOT TO COMPRESS—THAT IS THE QUESTION
International Journal of Dermatology, 1979J A, Witkowski, L C, Parish
openaire +2 more sources
Compressed Membership in Automata with Compressed Labels
2011The algorithmic problem of whether a compressed string is accepted by a (nondeterministic) finite state automaton with compressed transition labels is investigated. For string compression, straight-line programs (SLPs), i.e., contextfree grammars that generate exactly one string, are used. Two algorithms for this problem are presented.
Markus Lohrey, Christian Mathissen
openaire +1 more source