2125 search results - page 106 / 425 » On Graph Complexity |
115
click to vote
FAC
2002
15 years 2 months ago
2002
Action calculi, which generalise process calculi such as Petri nets, -calculus and ambient calculus, have been presented in terms of action graphs. We here offer linear action grap...
154
click to vote
CVPR
2012
IEEE
13 years 4 months ago
2012
IEEE
Mode-seeking has been widely used as a powerful data analysis technique for clustering and filtering in a metric feature space. We introduce a versatile and efficient modeseekin...
124
click to vote
FOCS
2006
IEEE
15 years 8 months ago
2006
IEEE
The quantum query complexity of searching for local optima has been a subject of much interest in the recent literature. For the d-dimensional grid graphs, the complexity has been...
157
click to vote
PPDP
2010
Springer
15 years 22 days ago
2010
Springer
This paperdescribes the use of a powerful graph query language for querying programs, and a novel combination of transformations for generating efficient implementations of the q...
140
click to vote
ICPADS
2007
IEEE
15 years 8 months ago
2007
IEEE
Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum weight subtree spanning a given subset of (terminal) nodes...