Sciweavers

1245 search results - page 161 / 249
» Binary Sparse Coding
Sort
View
FLAIRS
2007
15 years 5 months ago
Pursuing the Best ECOC Dimension for Multiclass Problems
Recent work highlights advantages in decomposing multiclass decision problems into multiple binary problems. Several strategies have been proposed for this decomposition. The most...
Edgar Pimenta, João Gama, André Carl...
TEC
2008
100views more  TEC 2008»
15 years 3 months ago
Real-Valued Compact Genetic Algorithms for Embedded Microcontroller Optimization
Recent research on compact genetic algorithms (cGAs) has proposed a number of evolutionary search methods with reduced memory requirements. In cGAs, the evolution of populations is...
Ernesto Mininno, Francesco Cupertino, David Naso
ICIP
2010
IEEE
15 years 1 months ago
Randomly driven fuzzy key extraction of unclonable images
In this paper, we develop an adjustable Fuzzy Extractor using the Physical Unclonable Functions (PUF) obtained by a common laser engraving method to sign physical objects. In part...
Saloomeh Shariati, Laurent Jacques, Françoi...
DNA
2011
Springer
233views Bioinformatics» more  DNA 2011»
14 years 3 months ago
Less Haste, Less Waste: On Recycling and Its Limits in Strand Displacement Systems
We study the potential for molecule recycling in chemical reaction systems and their DNA strand displacement realizations. Recycling happens when a product of one reaction is a rea...
Anne Condon, Alan J. Hu, Ján Manuch, Chris ...
APPROX
2005
Springer
111views Algorithms» more  APPROX 2005»
15 years 8 months ago
A Lower Bound on List Size for List Decoding
A q-ary error-correcting code C ⊆ {1, 2, . . . , q}n is said to be list decodable to radius ρ with list size L if every Hamming ball of radius ρ contains at most L codewords o...
Venkatesan Guruswami, Salil P. Vadhan