Sciweavers

4926 search results - page 211 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
163
Voted
SAC
2004
ACM
15 years 11 months ago
Frequent free tree discovery in graph data
In recent years, researchers in graph mining have been exploring linear paths as well as subgraphs as pattern languages. In this paper, we are investigating the middle ground betw...
Ulrich Rückert, Stefan Kramer
PPOPP
2012
ACM
14 years 1 months ago
Better speedups using simpler parallel programming for graph connectivity and biconnectivity
Speedups demonstrated for finding the biconnected components of a graph: 9x to 33x on the Explicit Multi-Threading (XMT) many-core computing platform relative to the best serial ...
James A. Edwards, Uzi Vishkin
ANTSW
2010
Springer
15 years 4 months ago
Evaluating the Robustness of Activator-Inhibitor Models for Cluster Head Computation
Activator-inhibitor models have been widely used to explain several morphogenetic processes. They have also been used to engineer algorithms for computer graphics, distributed syst...
Lidia Yamamoto, Daniele Miorandi
WG
2007
Springer
16 years 13 days ago
The Complexity of Bottleneck Labeled Graph Problems
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
Refael Hassin, Jérôme Monnot, Danny S...
ECCV
2004
Springer
16 years 8 months ago
A Biologically Motivated and Computationally Tractable Model of Low and Mid-Level Vision Tasks
This paper presents a biologically motivated model for low and mid-level vision tasks and its interpretation in computer vision terms. Initially we briefly present the biologically...
Iasonas Kokkinos, Rachid Deriche, Petros Maragos, ...