Sciweavers

2063 search results - page 63 / 413
» connection 2007
Sort
View
NIPS
2007
15 years 10 days ago
Gaussian Process Models for Link Analysis and Transfer Learning
In this paper we model relational random variables on the edges of a network using Gaussian processes (GPs). We describe appropriate GP priors, i.e., covariance functions, for dir...
Kai Yu, Wei Chu
91
Voted
COMBINATORICS
2007
100views more  COMBINATORICS 2007»
14 years 11 months ago
Revisiting Two Classical Results on Graph Spectra
Let µ (G) and µmin (G) be the largest and smallest eigenvalues of the adjacency matrix of a graph G. Our main results are: (i) If H is a proper subgraph of a connected graph G o...
Vladimir Nikiforov
82
Voted
JSC
2007
84views more  JSC 2007»
14 years 10 months ago
Simplicial cycles and the computation of simplicial trees
We generalize the concept of a cycle from graphs to simplicial complexes. We show that a simplicial cycle is either a sequence of facets connected in the shape of a circle, or is ...
Massimo Caboara, Sara Faridi, Peter Selinger
BMCBI
2004
85views more  BMCBI 2004»
14 years 10 months ago
Frequent occurrence of recognition Site-like sequences in the restriction endonucleases
Background: There are two different theories about the development of the genetic code. Woese suggested that it was developed in connection with the amino acid repertoire, while C...
Jan C. Biro, Josephine M. K. Biro
99
Voted
GECCO
2007
Springer
182views Optimization» more  GECCO 2007»
15 years 5 months ago
Generating large-scale neural networks through discovering geometric regularities
Connectivity patterns in biological brains exhibit many repeating motifs. This repetition mirrors inherent geometric regularities in the physical world. For example, stimuli that ...
Jason Gauci, Kenneth O. Stanley