Sciweavers

4298 search results - page 192 / 860
» Measurable chromatic numbers
Sort
View
COMBINATORICS
2006
107views more  COMBINATORICS 2006»
15 years 6 months ago
The Linear Complexity of a Graph
The linear complexity of a matrix is a measure of the number of additions, subtractions, and scalar multiplications required to multiply that matrix and an arbitrary vector. In th...
David L. Neel, Michael E. Orrison
IPL
2006
74views more  IPL 2006»
15 years 6 months ago
Periodic and Sturmian languages
Counting the number of distinct factors in the words of a language gives a measure of complexity for that language similar to the factor-complexity of infinite words. Similarly as ...
Lucian Ilie, Solomon Marcus, Ion Petre
JMIV
2006
78views more  JMIV 2006»
15 years 6 months ago
Shape Estimation from Support and Diameter Functions
We address the problem of reconstructing a planar shape from a finite number of noisy measurements of its support function or its diameter function. New linear and non-linear algor...
Amyn Poonawala, Peyman Milanfar, Richard J. Gardne...
ORL
2008
115views more  ORL 2008»
15 years 6 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
JALC
2007
84views more  JALC 2007»
15 years 6 months ago
Enumeration of Context-Free Languages and Related Structures
In this paper, we consider the enumeration of context-free languages. In particular, for any reasonable descriptional complexity measure for context-free grammars, we demonstrate ...
Michael Domaratzki, Alexander Okhotin, Jeffrey Sha...