400 search results - page 6 / 80 » Derandomization and Distinguishing Complexity |
TSP
2008
14 years 9 months ago
2008
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...
81
Voted
MST
2006
14 years 9 months ago
2006
A central question in computational biology is the design of genetic markers to distinguish between two given sets of (DNA) sequences. This question is formalized as the NP-comple...
104
click to vote
IROS
2006
IEEE
15 years 3 months ago
2006
IEEE
— Scan-matching based on data from a laser scanner is frequently used for mapping and localization. This paper presents an scan-matching approach based instead on visual informat...
IWSEC
2009
Springer
15 years 4 months ago
2009
Springer
The software-efficient stream cipher HC-256 was proposed by Wu at FSE 2004. Due to its impressive performance, the cipher was also a well-received entrant to the ECRYPT eSTREAM com...
BMCBI
2007
14 years 9 months ago
2007
Background: Construction and interpretation of phylogenetic trees has been a major research topic for understanding the evolution of genes. Increases in sequence data and complexi...