1538 search results - page 105 / 308 » Spectral Techniques in Graph Algorithms |
ICASSP
2010
IEEE
15 years 1 months ago
2010
IEEE
Graphs are canonical examples of high-dimensional non-Euclidean data sets, and are emerging as a common data structure in many fields. While there are many algorithms to analyze ...
EJC
2010
15 years 1 months ago
2010
We introduce the idea of Assur graphs, a concept originally developed and exclusively employed in the literature of the kinematics community. The paper translates the terminology,...
128
click to vote
SSPR
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. In order to use structural techniques from graph-based pattern recognition, a first necessary step consists in extracting a graph in an automatic way from an image. We pr...
137
click to vote
AI
2011
Springer
14 years 8 months ago
2011
Springer
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is base...
161
click to vote
APPROX
2000
Springer
15 years 5 months ago
2000
Springer
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...