Sciweavers

368 search results - page 24 / 74
» Higher Eigenvalues of Graphs
Sort
View
JCM
2008
76views more  JCM 2008»
13 years 7 months ago
Waterfilling Estimation for AWGN MIMO Channel Modeled as a Random Matrix
Waterfilling solutions provide optimal power distribution in multiple-input multiple-output (MIMO) system design. However, the optimal distribution is usually obtained through cost...
Victor M. Vergara, Silvio E. Barbin, Ramiro Jordan
NC
2007
123views Neural Networks» more  NC 2007»
13 years 7 months ago
The complexity of latching transitions in large scale cortical networks
Abstract. We study latching dynamics, i.e. the ability of a network to hop spontaneously from one discrete attractor state to another, which has been proposed as a model of an inï¬...
Emilio Kropff, Alessandro Treves
ICPR
2010
IEEE
13 years 5 months ago
Verification Under Increasing Dimensionality
Verification decisions are often based on second order statistics estimated from a set of samples. Ongoing growth of computational resources allows for considering more and more fe...
Anne Hendrikse, Raymond N. J. Veldhuis, Luuk J. Sp...
COMBINATORICS
2000
88views more  COMBINATORICS 2000»
13 years 7 months ago
Note on Sparse Random Graphs and Cover Graphs
It is shown in this note that with high probability it is enough to destroy all triangles in order to get a cover graph from a random graph Gn,p with p log n/n for any constant ...
Tom Bohman, Alan M. Frieze, Miklós Ruszink&...
CIKM
2009
Springer
14 years 2 months ago
Learning to rank graphs for online similar graph search
Many applications in structure matching require the ability to search for graphs that are similar to a query graph, i.e., similarity graph queries. Prior works, especially in chem...
Bingjun Sun, Prasenjit Mitra, C. Lee Giles