|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
No Growbag Graphs found.
|
|
|
|
|
Results
Found 21 publication records. Showing 21 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Chee Wei Tan, Shmuel Friedland, Steven H. Low |
Spectrum Management in Multiuser Cognitive Wireless Networks: Optimality and Algorithm.  |
IEEE Journal on Selected Areas in Communications  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Chee Wei Tan, Shmuel Friedland, Steven H. Low |
Nonnegative Matrix Inequalities and their Application to Nonconvex Power Control Optimization. |
SIAM J. Matrix Analysis Applications |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Shmuel Friedland, Per Håkan Lundow, Klas Markström |
The 1-vertex transfer matrix and accurate estimation of channel capacity. |
IEEE Transactions on Information Theory |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Anatoli Torokhti, Shmuel Friedland |
Towards theory of generic Principal Component Analysis. |
J. Multivariate Analysis |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Shmuel Friedland |
Graph isomorphism and volumes of convex bodies |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Amitava Bhattacharya, Shmuel Friedland, Uri N. Peled |
On the First Eigenvalue of Bipartite Graphs. |
Electr. J. Comb. |
2008 |
DBLP BibTeX RDF |
|
| 1 | Noga Alon, Shmuel Friedland |
The Maximum Number of Perfect Matchings in Graphs with a Given Degree Sequence. |
Electr. J. Comb. |
2008 |
DBLP BibTeX RDF |
|
| 1 | Avi Berman, Shmuel Friedland, Leslie Hogben, Uriel G. Rothblum, Bryan L. Shader |
Minimum Rank of Matrices Described by a Graph or Pattern over the Rational, Real and Complex Numbers. |
Electr. J. Comb. |
2008 |
DBLP BibTeX RDF |
|
| 1 | Shmuel Friedland, E. Krop, Klas Markström |
On the Number of Matchings in Regular Graphs. |
Electr. J. Comb. |
2008 |
DBLP BibTeX RDF |
|
| 1 | Shmuel Friedland, Leonid Gurvits |
Lower Bounds for Partial Matchings in Regular Bipartite Graphs and Applications to the Monomer-Dimer Entropy. |
Combinatorics, Probability & Computing |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Shmuel Friedland |
On the graph isomorphism problem |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Shmuel Friedland |
FPRAS for computing a lower bound for weighted matching polynomial of graphs |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Shmuel Friedland, Anatoli Torokhti |
Generalized Rank-Constrained Matrix Approximations. |
SIAM J. Matrix Analysis Applications |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Shmuel Friedland, Daniel Levy |
A polynomial-time approximation algorithm for the number of k-matchings in bipartite graphs |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Shmuel Friedland, Mostafa Kaveh, Amir Niknejad, Hossein Zare |
Fast Monte-Carlo Low Rank Approximations for Matrices |
CoRR |
2005 |
DBLP BibTeX RDF |
|
| 1 | Shmuel Friedland |
A New Approach to Generalized Singular Value Decomposition. |
SIAM J. Matrix Analysis Applications |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Jon-Lark Kim, Uri N. Peled, I. Perepelitsa, Vera Pless, Shmuel Friedland |
Explicit construction of families of LDPC codes with no 4-cycles. |
IEEE Transactions on Information Theory |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Shmuel Friedland |
Every 7-regular digraph contains an even cycle. |
J. Comb. Theory, Ser. B |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Shmuel Friedland |
Coherent algebras and the graph isomorphism problem. |
Discrete Applied Mathematics |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Shmuel Friedland, Gil Kalai |
Regular subgraphs of almost regular graphs. |
J. Comb. Theory, Ser. B |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Shmuel Friedland, Gil Kalai |
Every 4-regular graph plus an edge contains a 3-regular subgraph. |
J. Comb. Theory, Ser. B |
1984 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #21 of 21 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")