Sciweavers

678 search results - page 2 / 136
» Structural Properties of Sparse Graphs
Sort
View
CORR
2010
Springer
101views Education» more  CORR 2010»
13 years 5 months ago
On a Low-Rate TLDPC Code Ensemble and the Necessary Condition on the Linear Minimum Distance for Sparse-Graph Codes
Abstract-- This paper addresses the issue of design of lowrate sparse-graph codes with linear minimum distance in the blocklength. First, we define a necessary condition which need...
Iryna Andriyanova, Jean-Pierre Tillich
FOCS
2010
IEEE
13 years 2 months ago
Deciding First-Order Properties for Sparse Graphs
Zdenek Dvorak, Daniel Král, Robin Thomas
PVLDB
2008
116views more  PVLDB 2008»
13 years 4 months ago
Anonymizing bipartite graph data using safe groupings
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...
Graham Cormode, Divesh Srivastava, Ting Yu, Qing Z...
UAI
1996
13 years 6 months ago
An evaluation of structural parameters for probabilistic reasoning: Results on benchmark circuits
Many algorithms for processing probabilistic networks are dependent on the topological properties of the problem's structure. Such algorithmse.g., clustering, conditioning ar...
Yousri El Fattah, Rina Dechter
SPAA
1998
ACM
13 years 9 months ago
Elimination Forest Guided 2D Sparse LU Factorization
Sparse LU factorization with partial pivoting is important for many scienti c applications and delivering high performance for this problem is di cult on distributed memory machin...
Kai Shen, Xiangmin Jiao, Tao Yang