2612 search results - page 179 / 523 » Assemblies as Graph Processes |
182
click to vote
DAM
2007
15 years 6 months ago
2007
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
194
click to vote
PKDD
2010
Springer
15 years 4 months ago
2010
Springer
The goal of graph clustering is to partition objects in a graph database into different clusters based on various criteria such as vertex connectivity, neighborhood similarity or t...
177
click to vote
ICIP
2008
IEEE
16 years 8 months ago
2008
IEEE
In many neurophysiological studies, understanding the neuronal circuitry of the brain requires detailed 3D models of the nerve cells and their synapses. Typically, researchers bui...
166
click to vote
ICIP
2001
IEEE
16 years 8 months ago
2001
IEEE
Optimal mode selection for video coding is important in minimizing visual distortion given a rate constraint, and it has been studied in the literature using a single previous mac...
180
click to vote
ICSE
2008
IEEE-ACM
16 years 7 months ago
2008
IEEE-ACM
In software development, resources for quality assurance are limited by time and by cost. In order to allocate resources effectively, managers need to rely on their experience bac...