Zobrazeno 1 - 10
of 24
pro vyhledávání: '"Trincă, Dragoş"'
Comparison of Sinogram-based Iterative Reconstruction with Compressed Sensing Techniques in X-ray CT
Autor:
Trinca, Dragos, Libin, Eduard
Performing X-ray computed tomography (CT) examinations with less radiation has recently received increasing interest: in medical imaging this means less (potentially harmful) radiation for the patient; in non-destructive testing of materials/objects
Externí odkaz:
http://arxiv.org/abs/1809.08308
Oligonucleotide arrays are used in a wide range of genomic analyses, such as gene expression profiling, comparative genomic hybridization, chromatin immunoprecipitation, SNP detection, etc. During fabrication, the sites of an oligonucleotide array ar
Externí odkaz:
http://arxiv.org/abs/1110.3959
Autor:
Trinca, Dragos
Adaptive (variable-length) codes associate variable-length codewords to symbols being encoded depending on the previous symbols in the input data string. This class of codes has been presented in [Dragos Trinca, cs.DS/0505007] as a new class of non-s
Externí odkaz:
http://arxiv.org/abs/cs/0508088
Autor:
Trinca, Dragos
In 1994, Burrows and Wheeler developed a data compression algorithm which performs significantly better than Lempel-Ziv based algorithms. Since then, a lot of work has been done in order to improve their algorithm, which is based on a reversible tran
Externí odkaz:
http://arxiv.org/abs/cs/0508086
Autor:
Trinca, Dragos
Adaptive codes associate variable-length codewords to symbols being encoded depending on the previous symbols in the input data string. This class of codes has been introduced in [Dragos Trinca, cs.DS/0505007] as a new class of non-standard variable-
Externí odkaz:
http://arxiv.org/abs/cs/0508089
Autor:
Trinca, Dragos
Adaptive codes have been introduced in [Dragos Trinca, cs.DS/0505007] as a new class of non-standard variable-length codes. These codes associate variable-length codewords to symbols being encoded depending on the previous symbols in the input data s
Externí odkaz:
http://arxiv.org/abs/cs/0508090
Autor:
Trinca, Dragos
The well-known Eulerian path problem can be solved in polynomial time (more exactly, there exists a linear time algorithm for this problem). In this paper, we model the problem using a string matching framework, and then initiate an algorithmic study
Externí odkaz:
http://arxiv.org/abs/cs/0508087
Autor:
Trinca, Dragos
Adaptive variable-length codes associate a variable-length codeword to the symbol being encoded depending on the previous symbols in the input string. This class of codes has been recently presented in [Dragos Trinca, arXiv:cs.DS/0505007] as a new cl
Externí odkaz:
http://arxiv.org/abs/cs/0505061
Autor:
Trinca, Dragos
We introduce a new class of non-standard variable-length codes, called adaptive codes. This class of codes associates a variable-length codeword to the symbol being encoded depending on the previous symbols in the input data string. An efficient algo
Externí odkaz:
http://arxiv.org/abs/cs/0505007
Autor:
Mandoiu, Ion I., Trinca, Dragos
In this paper we propose new solution methods for designing tag sets for use in universal DNA arrays. First, we give integer linear programming formulations for two previous formalizations of the tag set design problem, and show that these formulatio
Externí odkaz:
http://arxiv.org/abs/cs/0503057