Sciweavers

215 search results - page 8 / 43
» The asymptotic number of binary codes and binary matroids
Sort
View
ICA
2010
Springer
14 years 10 months ago
Binary Sparse Coding
We study a sparse coding learning algorithm that allows for a simultaneous learning of the data sparseness and the basis functions. The algorithm is derived based on a generative m...
Marc Henniges, Gervasio Puertas, Jörg Bornsch...
CORR
2010
Springer
77views Education» more  CORR 2010»
14 years 9 months ago
The Binary-Symmetric Parallel-Relay Network
We present capacity results of the binary-symmetric parallel-relay network, where there is one source, one destination, and K relays in parallel. We show that forwarding relays, wh...
Lawrence Ong, Sarah J. Johnson, Christopher M. Kel...
SIAMDM
2008
99views more  SIAMDM 2008»
14 years 9 months ago
Phase Changes in Subtree Varieties in Random Recursive and Binary Search Trees
We study the variety of subtrees lying on the fringe of recursive trees and binary search trees by analyzing the distributional behavior of Xn,k, which counts the number of subtree...
Qunqiang Feng, Hosam M. Mahmoud, Alois Panholzer
ALGORITHMICA
2006
174views more  ALGORITHMICA 2006»
14 years 9 months ago
Profiles of Random Trees: Limit Theorems for Random Recursive Trees and Binary Search Trees
We prove convergence in distribution for the profile (the number of nodes at each level), normalized by its mean, of random recursive trees when the limit ratio of the level and ...
Michael Fuchs, Hsien-Kuei Hwang, Ralph Neininger
JDA
2010
88views more  JDA 2010»
14 years 8 months ago
Greedy colorings for the binary paintshop problem
Cars have to be painted in two colors in a sequence where each car occurs twice; assign the two colors to the two occurrences of each car so as to minimize the number of color chan...
Hadis Amini, Frédéric Meunier, H&eac...