Sciweavers

1972 search results - page 21 / 395
» connection 2008
Sort
View
RAS
2008
90views more  RAS 2008»
13 years 6 months ago
Closed loop motion planning of cooperating mobile robots using graph connectivity
Guilherme A. S. Pereira, Vijay Kumar, Mario Fernan...
CONNECTION
2004
92views more  CONNECTION 2004»
13 years 7 months ago
High capacity associative memories and connection constraints
: High capacity associative neural networks can be built from networks of perceptrons, trained using simple perceptron training. Such networks perform much better than those traine...
Neil Davey, Rod Adams
NETWORKING
2008
13 years 8 months ago
On the Robustness of Complex Networks by Using the Algebraic Connectivity
The second smallest eigenvalue of the Laplacian matrix, also known as the algebraic connectivity, plays a special role for the robustness of complex networks since it measures the ...
A. Jamakovic, Piet Van Mieghem
ORL
2008
115views more  ORL 2008»
13 years 7 months ago
Maximum algebraic connectivity augmentation is NP-hard
The algebraic connectivity of a graph, which is the second-smallest eigenvalue of the Laplacian of the graph, is a measure of connectivity. We show that the problem of adding a sp...
Damon Mosk-Aoyama
BMCBI
2008
77views more  BMCBI 2008»
13 years 7 months ago
A simple and robust method for connecting small-molecule drugs using gene-expression signatures
Background: Interaction of a drug or chemical with a biological system can result in a geneexpression profile or signature characteristic of the event. Using a suitably robust alg...
Shu-Dong Zhang, Timothy W. Gant