Sciweavers

783 search results - page 75 / 157
» A Framework for Exploring Optimization Properties
Sort
View
JMLR
2010
99views more  JMLR 2010»
13 years 3 months ago
Characterization, Stability and Convergence of Hierarchical Clustering Methods
We study hierarchical clustering schemes under an axiomatic view. We show that within this framework, one can prove a theorem analogous to one of J. Kleinberg (Kleinberg, 2002), i...
Gunnar Carlsson, Facundo Mémoli
WAW
2009
Springer
138views Algorithms» more  WAW 2009»
14 years 3 months ago
Information Theoretic Comparison of Stochastic Graph Models: Some Experiments
The Modularity-Q measure of community structure is known to falsely ascribe community structure to random graphs, at least when it is naively applied. Although Q is motivated by a ...
Kevin J. Lang
CMSB
2006
Springer
14 years 15 days ago
Compositional Reachability Analysis of Genetic Networks
Genetic regulatory networks have been modeled as discrete transition systems by many approaches, benefiting from a large number of formal verification algorithms available for the ...
Gregor Gößler
COLING
1994
13 years 10 months ago
Universal Guides And Finiteness And Symmetry Of Grammar Processing Algorithms
This paper presents a novel technique called "universal guides" which explores inherent properties of logic grammars (changing variable binding status) in order to chara...
Miroslav Martinovic
CORR
2010
Springer
198views Education» more  CORR 2010»
13 years 5 months ago
Convex Graph Invariants
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper ...
Venkat Chandrasekaran, Pablo A. Parrilo, Alan S. W...