Sciweavers

33 search results - page 3 / 7
» Cliques and the spectral radius
Sort
View
LION
2009
Springer
125views Optimization» more  LION 2009»
14 years 2 months ago
New Bounds on the Clique Number of Graphs Based on Spectral Hypergraph Theory
This work introduces new bounds on the clique number of graphs derived from a result due to S´os and Straus, which generalizes the Motzkin-Straus Theorem to a specific class of h...
Samuel Rota Bulò, Marcello Pelillo
HYBRID
2004
Springer
14 years 26 days ago
Approximations of the Rate of Growth of Switched Linear Systems
The joint spectral radius of a set of matrices is a measure of the maximal asymptotic growth rate that can be obtained by forming long products of matrices taken from the set. This...
Vincent D. Blondel, Yurii Nesterov, Jacques Theys
MOC
1998
86views more  MOC 1998»
13 years 7 months ago
Vector subdivision schemes and multiple wavelets
We consider solutions of a system of refinement equations written in the form φ = α∈Z a(α)φ(2 · −α), where the vector of functions φ = (φ1, . . . , φr)T is in (Lp(R))...
Rong-Qing Jia, Sherman D. Riemenschneider, Ding-Xu...
ICDM
2008
IEEE
122views Data Mining» more  ICDM 2008»
14 years 1 months ago
Nonnegative Matrix Factorization for Combinatorial Optimization: Spectral Clustering, Graph Matching, and Clique Finding
Nonnegative matrix factorization (NMF) is a versatile model for data clustering. In this paper, we propose several NMF inspired algorithms to solve different data mining problems....
Chris H. Q. Ding, Tao Li, Michael I. Jordan
FSTTCS
2010
Springer
13 years 5 months ago
Two Size Measures for Timed Languages
Quantitative properties of timed regular languages, such as information content (growth rate, entropy) are explored. The approach suggested by the same authors is extended to lang...
Eugene Asarin, Aldric Degorre