Sciweavers

2520 search results - page 15 / 504
» The complexity of approximating entropy
Sort
View
INFORMATICALT
2010
142views more  INFORMATICALT 2010»
13 years 8 months ago
Complexity Estimation of Genetic Sequences Using Information-Theoretic and Frequency Analysis Methods
The genetic information in cells is stored in DNA sequences, represented by a string of four letters, each corresponding to a definite type of nucleotides. Genomic DNA sequences a...
Robertas Damasevicius
IBPRIA
2007
Springer
14 years 3 months ago
Robust Complex Salient Regions
Abstract. The challenge of interest point detectors is to find, in an unsupervised way, keypoints easy to extract and at the same time robust to image transformations. In this pap...
Sergio Escalera, Oriol Pujol, Petia Radeva
IJCNLP
2004
Springer
14 years 3 months ago
Tagging Complex NEs with MaxEnt Models: Layered Structures Versus Extended Tagset
The paper discusses two policies for recognizing NEs with complex structures by maximum entropy models. One policy is to develop cascaded MaxEnt models at different levels. The ot...
Deyi Xiong, Hongkui Yu, Qun Liu
TSP
2008
94views more  TSP 2008»
13 years 9 months ago
Cross-Entropy-Based Sign-Selection Algorithms for Peak-to-Average Power Ratio Reduction of OFDM Systems
Sign-selection uses a set of subcarrier signs to reduce the peak-to-average power ratio (PAR) of orthogonal-frequency-division multiplexing (OFDM). However, the computational compl...
Luqing Wang, Chintha Tellambura
COCOON
2005
Springer
14 years 3 months ago
Randomized Quicksort and the Entropy of the Random Source
Abstract. The worst-case complexity of an implementation of Quicksort depends on the random number generator that is used to select the pivot elements. In this paper we estimate th...
Beatrice List, Markus Maucher, Uwe Schöning, ...