92 search results - page 16 / 19 » Quasi-randomness and Algorithmic Regularity for Graphs with ... |
PODC
2004
ACM
14 years 4 days ago
2004
ACM
We analyze the properties of Small-World networks, where links are much more likely to connect “neighbor nodes” than distant nodes. In particular, our analysis provides new re...
PRL
2010
13 years 5 months ago
2010
: Single training image face recognition is one of main challenges to appearance-based pattern recognition techniques. Many classical dimensionality reduction methods such as LDA h...
KDD
2010
ACM
13 years 10 months ago
2010
ACM
Constrained clustering has been well-studied for algorithms like K-means and hierarchical agglomerative clustering. However, how to encode constraints into spectral clustering rem...
KDD
2008
ACM
14 years 7 months ago
2008
ACM
A hypergraph is a generalization of the traditional graph in which the edges are arbitrary non-empty subsets of the vertex set. It has been applied successfully to capture highord...
SPAA
2003
ACM
13 years 12 months ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...