Results 251 to 260 of about 1,409,223 (260)
Some of the next articles are maybe not open access.
Combinatorica, 1984
Let H be a graph which is the union of copies of a graph G. Associated with H (and the specified copies of G) is the hypergraph \({\mathcal H}\) whose vertices are the edges of H and whose hyperedges are the edge sets of these specified copies of G. The graph H t-arrows G \((H\to(G)_ t)\) if for any coloring of the edges of H with t colors, there is an
Nešetřil, Jaroslav, Rödl, Vojtěch
openaire +1 more source
Let H be a graph which is the union of copies of a graph G. Associated with H (and the specified copies of G) is the hypergraph \({\mathcal H}\) whose vertices are the edges of H and whose hyperedges are the edge sets of these specified copies of G. The graph H t-arrows G \((H\to(G)_ t)\) if for any coloring of the edges of H with t colors, there is an
Nešetřil, Jaroslav, Rödl, Vojtěch
openaire +1 more source
Sparse Topical Coding with Sparse Groups
2016Learning a latent semantic representing from a large number of short text corpora makes a profound practical significance in research and engineering. However, it is difficult to use standard topic models in microblogging environments since microblogs have short length, large amount, snarled noise and irregular modality characters, which prevent topic ...
Min Peng +6 more
openaire +1 more source
Sparse Coding in Sparse Winner Networks
2007This paper investigates a mechanism for reliable generation of sparse code in a sparsely connected, hierarchical, learning memory. Activity reduction is accomplished with local competitions that suppress activities of unselected neurons so that costly global competition is avoided.
Janusz A. Starzyk +2 more
openaire +1 more source
European Journal of Drug Metabolism and Pharmacokinetics, 1993
In recent years there has been a growing interest in techniques capable of analyzing sparse data, particularly gathered during Phase III clinical trials, and there is now pressure on manufacturers to obtain more kinetic and dynamic information from Phase III studies.
openaire +2 more sources
In recent years there has been a growing interest in techniques capable of analyzing sparse data, particularly gathered during Phase III clinical trials, and there is now pressure on manufacturers to obtain more kinetic and dynamic information from Phase III studies.
openaire +2 more sources
Sparse modelling and sparse signal reconstruction
Abstract Signal models are central to solving inverse problems, and reconstruction methods either implicitly or explicitly make use of signal models. Assuming the unknown signal of interest lies in a class of signals described by a signal model, we wish to reconstruct the signal with an algorithm that is sample efficient (i.e., only ...openaire +1 more source