Sciweavers

5 search results - page 1 / 1
» Extremal bipartite graphs with high girth
Sort
View
ARSCOM
2007
77views more  ARSCOM 2007»
13 years 5 months ago
Extremal bipartite graphs with high girth
Let us denote by EX (m, n; {C4, . . . , C2t}) the family of bipartite graphs G with m and n vertices in its classes that contain no cycles of length less than or equal to 2t and h...
Camino Balbuena, Pedro García-Vázque...
TCOM
2011
170views more  TCOM 2011»
12 years 11 months ago
On Girth Conditioning for Low-Density Parity-Check Codes
—Low-density parity-check (LDPC) codes are gaining interest for high data rate applications in both terrestrial and spatial communications. They can be designed and studied throu...
Samuele Bandi, Velio Tralli, Andrea Conti, Maddale...
SDM
2009
SIAM
251views Data Mining» more  SDM 2009»
14 years 2 months ago
High Performance Parallel/Distributed Biclustering Using Barycenter Heuristic.
Biclustering refers to simultaneous clustering of objects and their features. Use of biclustering is gaining momentum in areas such as text mining, gene expression analysis and co...
Alok N. Choudhary, Arifa Nisar, Waseem Ahmad, Wei-...
SLIP
2003
ACM
13 years 10 months ago
Fast estimation of the partitioning rent characteristic using a recursive partitioning model
In the past, a priori interconnect prediction, based on Rent’s rule, has been applied mainly for technology evaluation and roadmap applications. These applications do not requir...
Joni Dambre, Dirk Stroobandt, Jan Van Campenhout
SIGCOMM
2004
ACM
13 years 10 months ago
Work-conserving distributed schedulers for Terabit routers
−Buffered multistage interconnection networks offer one of the most scalable and cost-effective approaches to building high capacity routers. Unfortunately, the performance of su...
Prashanth Pappu, Jonathan S. Turner, Kenneth Wong