Sciweavers

3267 search results - page 199 / 654
» Generalized quasirandom graphs
Sort
View
WG
2007
Springer
16 years 21 days ago
On Finding Graph Clusterings with Maximum Modularity
Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines, and in particular in the compl...
Ulrik Brandes, Daniel Delling, Marco Gaertler, Rob...
ICWE
2005
Springer
16 years 3 days ago
Automatic Optimization of Web Recommendations Using Feedback and Ontology Graphs
Abstract. Web recommendation systems have become a popular means to improve the usability of web sites. This paper describes the architecture of a rulebased recommendation system a...
Nick Golovin, Erhard Rahm
COMPSAC
2003
IEEE
15 years 12 months ago
A Graph Grammar Approach to Software Architecture Verification and Transformation
Software architecture and design are usually modeled and represented by informal diagrams, such as architecture diagrams and UML diagrams. While these graphic notations are easy t...
Jun Kong, Kang Zhang, Jing Dong, Guang-Lei Song
CVPR
2003
IEEE
15 years 12 months ago
Graph-Theoretic Approach to Clustering and Segmentation
We develop a framework for the image segmentation problem based on a new graph-theoretic formulation of clustering. The approach is motivated by the analogies between the intuitiv...
Massimiliano Pavan, Marcello Pelillo
ICRA
2002
IEEE
106views Robotics» more  ICRA 2002»
15 years 11 months ago
An Improved Random Neighborhood Graph Approach
As a general framework to determine a collision-free feedback motion strategies, the Random Neighborhood Graph (RNG) approach [19] defines a global navigation function over an ap...
Libo Yang, Steven M. LaValle