402 search results - page 48 / 81 » On Finding the Number of Graph Automorphisms |
113
click to vote
SIGSOFT
2009
ACM
16 years 17 days ago
2009
ACM
A bug report is typically assigned to a single developer who is then responsible for fixing the bug. In Mozilla and Eclipse, between 37%-44% of bug reports are "tossed" ...
119
click to vote
CVPR
2004
IEEE
15 years 3 months ago
2004
IEEE
Graphical models are powerful tools for processing images. However, the large dimensionality of even local image data poses a difficulty: representing the range of possible graphi...
DISOPT
2010
14 years 12 months ago
2010
We consider labeled Traveling Salesman Problems, defined upon a complete graph of n vertices with colored edges. The objective is to find a tour of maximum or minimum number of co...
CPC
2006
14 years 12 months ago
2006
Abstract. Bootstrap percolation on an arbitrary graph has a random initial configuration, where each vertex is occupied with probability p, independently of each other, and a deter...
109
click to vote
KDD
2008
ACM
16 years 7 days ago
2008
ACM
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...