Sciweavers

1083 search results - page 46 / 217
» On the Number of Optimal Base 2 Representations of Integers
Sort
View
TC
1998
14 years 9 months ago
Algorithms for Variable Length Subnet Address Assignment
In a computer network that consists of M subnetworks, the L-bit address of a machine consists of two parts: A pre x si that contains the address of the subnetwork to which the mac...
Mikhail J. Atallah, Douglas Comer
ICML
2010
IEEE
14 years 11 months ago
Submodular Dictionary Selection for Sparse Representation
We develop an efficient learning framework to construct signal dictionaries for sparse representation by selecting the dictionary columns from multiple candidate bases. By sparse,...
Andreas Krause, Volkan Cevher
GECCO
2004
Springer
118views Optimization» more  GECCO 2004»
15 years 3 months ago
Adapting Representation in Genetic Programming
Genetic Programming uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees....
Cezary Z. Janikow
IJDAR
2006
131views more  IJDAR 2006»
14 years 9 months ago
Genetic engineering of hierarchical fuzzy regional representations for handwritten character recognition
This paper presents a genetic programming based approach for optimizing the feature extraction step of a handwritten character recognizer. This recognizer uses a simple multilayer ...
Christian Gagné, Marc Parizeau
STOC
2009
ACM
160views Algorithms» more  STOC 2009»
15 years 10 months ago
CSP gaps and reductions in the lasserre hierarchy
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
Madhur Tulsiani