Sciweavers

368 search results - page 21 / 74
» Higher Eigenvalues of Graphs
Sort
View
RECOMB
2010
Springer
14 years 23 days ago
SubMAP: Aligning Metabolic Pathways with Subnetwork Mappings
Abstract. We consider the problem of aligning two metabolic pathways. Unlike traditional approaches, we do not restrict the alignment to one-to-one mappings between the molecules o...
Ferhat Ay, Tamer Kahveci
RSA
2010
94views more  RSA 2010»
13 years 6 months ago
Word maps and spectra of random graph lifts
We study here the spectra of random lifts of graphs. Let G be a finite connected graph, and let the infinite tree T be its universal cover space. If λ1 and ρ are the spectral ...
Nati Linial, Doron Puder
SIBGRAPI
2006
IEEE
14 years 1 months ago
Increasing statistical power in medical image analysis
In this paper, we present a novel method for estimating the effective number of independent variables in imaging applications that require multiple hypothesis testing. The method ...
Alexei Manso Correa Machado
ISBI
2011
IEEE
12 years 11 months ago
Differential information content in staggered multiple shell hardi measured by the tensor distribution function
Diffusion tensor imaging has accelerated the study of brain connectivity, but single-tensor diffusion models are too simplistic to model fiber crossing and mixing. Hybrid diffusio...
Liang Zhan, Alex D. Leow, Iman Aganj, Christophe L...
DMTCS
2010
133views Mathematics» more  DMTCS 2010»
13 years 5 months ago
An improved bound on the largest induced forests for triangle-free planar graphs
We proved that every planar triangle-free graph with n vertices has a subset of vertices that induces a forest of size at least (71n + 72)/128. This improves the earlier work of S...
Lukasz Kowalik, Borut Luzar, Riste Skrekovski