401 search results - page 30 / 81 » Sparse Quasi-Random Graphs |
TC
1998
13 years 7 months ago
1998
A bipartite concentrator is a single stage sparse crossbar switching device that can connect any m of its n ≥ m inputs to its m outputs possibly without the ability to distingui...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
`Approximate message passing' algorithms proved to be extremely effective in reconstructing sparse signals from a small number of incoherent linear measurements. Extensive num...
PVLDB
2008
13 years 7 months ago
2008
Private data often comes in the form of associations between entities, such as customers and products bought from a pharmacy, which are naturally represented in the form of a larg...
OA
1989
13 years 12 months ago
1989
nce Abstract) 1 GAUTAM DAS - University of Wisconsin DEBORAH JOSEPH - University of Wisconsin Chew and Dobkin et. al. have shown that the Delaunay triangulation and its variants ar...
JMLR
2010
13 years 2 months ago
2010
We study the problem of learning an optimal Bayesian network in a constrained search space; skeletons are compelled to be subgraphs of a given undirected graph called the super-st...