Welcome to our site! EDAboard.com is an international Electronics Discussion Forum focused on EDA software, circuits, schematics, books, theory, papers, asic, pld, 8051, DSP, Network, RF, Analog Design, PCB, Service Manuals... and a whole lot more! To participate you need to register. Registration is free. Click here to register now.
Re: degree of a matrix
no actually..it is the number of edges formed by an element in a set with the elements in the other set..i have the solution nw..
suppose I have a matrix(u,v) and let the graph be plotted in bipartite graph with
u and v as sets..
how do i calculate degree of u and degree of v as well..
where u and v are just the dimensions..
hello again!!
Is there anyone who has worked on biclustering algorithms..
I am working on spectral biclustering data..
Here is the link:
http://papers.gersteinlab.org/e-print/biclusters/all.pdf
This site uses cookies to help personalise content, tailor your experience and to keep you logged in if you register.
By continuing to use this site, you are consenting to our use of cookies.