Sciweavers

2125 search results - page 125 / 425
» On Graph Complexity
Sort
View
ESANN
2006
14 years 11 months ago
Cluster detection algorithm in neural networks
Complex networks have received much attention in the last few years, and reveal global properties of interacting systems in domains like biology, social sciences and technology. O...
David Meunier, Hélène Paugam-Moisy
COCO
2001
Springer
135views Algorithms» more  COCO 2001»
15 years 2 months ago
Simple Analysis of Graph Tests for Linearity and PCP
We give a simple analysis of the PCP with low amortized query complexity of Samorodnitsky and Trevisan [16]. The analysis also applies to the linearity testing over finite field...
Johan Håstad, Avi Wigderson
CORR
2008
Springer
77views Education» more  CORR 2008»
14 years 10 months ago
Principal Graphs and Manifolds
In many physical statistical, biological and other investigations it is desirable to approximate a system of points by objects of lower dimension and/or complexity. For this purpo...
Alexander N. Gorban, Andrei Yu. Zinovyev
GG
2010
Springer
14 years 11 months ago
A Component Concept for Typed Graphs with Inheritance and Containment Structures
Model-driven development (MDD) has become a promising trend in software engineering. The model-driven development of highly complex software systems may lead to large models which ...
Stefan Jurack, Gabriele Taentzer
ICALP
2011
Springer
14 years 1 months ago
Clique Clustering Yields a PTAS for max-Coloring Interval Graphs
We are given an interval graph G = (V, E) where each interval I ∈ V has a weight wI ∈ R+. The goal is to color the intervals V with an arbitrary number of color classes C1, C2...
Tim Nonner