Sciweavers

1538 search results - page 77 / 308
» Spectral Techniques in Graph Algorithms
Sort
View
JSCIC
2008
82views more  JSCIC 2008»
15 years 1 months ago
Mathematical and Numerical Aspects of a Phase-field Approach to Critical Nuclei Morphology in Solids
Abstract We investigate a phase-field model for homogeneous nucleation and critical nucleus morphology in solids. We analyze the mathematical properties of a free energy functional...
Lei Zhang, Long-Qing Chen, Qiang Du
AUTOMATICA
2002
93views more  AUTOMATICA 2002»
15 years 1 months ago
A probabilistic framework for problems with real structured uncertainty in systems and control
The objective of this paper is twofold. First, the problem of generation of real random matrix samples with uniform distribution in structured (spectral) norm bounded sets is stud...
Giuseppe Carlo Calafiore, Fabrizio Dabbene
BMCBI
2010
183views more  BMCBI 2010»
15 years 1 months ago
SING: Subgraph search In Non-homogeneous Graphs
Background: Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image unders...
Raffaele Di Natale, Alfredo Ferro, Rosalba Giugno,...
DAC
1993
ACM
15 years 5 months ago
Rotation Scheduling: A Loop Pipelining Algorithm
— We consider the resource-constrained scheduling of loops with interiteration dependencies. A loop is modeled as a data flow graph (DFG), where edges are labeled with the numbe...
Liang-Fang Chao, Andrea S. LaPaugh, Edwin Hsing-Me...
WG
2007
Springer
15 years 7 months ago
Obtaining a Planar Graph by Vertex Deletion
In the Planar +k vertex problem the task is to find at most k vertices whose deletion makes the given graph planar. The graphs for which there exists a solution form a minor close...
Dániel Marx, Ildikó Schlotter