721 search results - page 89 / 145 » Graphs with Large Obstacle Numbers |
KDD
2012
ACM
11 years 11 months ago
2012
ACM
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...
CVPR
2010
IEEE
14 years 3 months ago
2010
IEEE
We introduce a novel framework for nonrigid feature
matching among multiple sets in a way that takes into consideration
both the feature descriptor and the features spatial
arra...
ICDCS
2003
IEEE
14 years 2 months ago
2003
IEEE
We introduce the hash history mechanism for capturing dependencies among distributed replicas. Hash histories, consisting of a directed graph of version hashes, are independent of...
SIGMOD
2008
ACM
14 years 9 months ago
2008
ACM
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...
SIGECOM
2006
ACM
14 years 3 months ago
2006
ACM
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...