Sciweavers

1133 search results - page 154 / 227
» Basics of Graph Cuts
Sort
View
MICRO
2009
IEEE
132views Hardware» more  MICRO 2009»
14 years 4 months ago
Finding concurrency bugs with context-aware communication graphs
Incorrect thread synchronization often leads to concurrency bugs that manifest nondeterministically and are difficult to detect and fix. Past work on detecting concurrency bugs ...
Brandon Lucia, Luis Ceze
PR
2007
141views more  PR 2007»
13 years 9 months ago
A Riemannian approach to graph embedding
In this paper, we make use of the relationship between the Laplace–Beltrami operator and the graph Laplacian, for the purposes of embedding a graph onto a Riemannian manifold. T...
Antonio Robles-Kelly, Edwin R. Hancock
ALENEX
2007
102views Algorithms» more  ALENEX 2007»
13 years 11 months ago
Linearization: Locally Self-Stabilizing Sorting in Graphs
We consider the problem of designing a distributed algorithm that, given an arbitrary connected graph G of nodes with unique labels, converts G into a sorted list of nodes. This a...
Melih Onus, Andréa W. Richa, Christian Sche...
CORR
1999
Springer
164views Education» more  CORR 1999»
13 years 9 months ago
Annotation graphs as a framework for multidimensional linguistic data analysis
In recent work we have presented a formal framework for linguistic annotation based on labeled acyclic digraphs. These `annotation graphs' oer a simple yet powerful method fo...
Steven Bird, Mark Liberman
ANOR
2004
170views more  ANOR 2004»
13 years 10 months ago
Graph Coloring for Air Traffic Flow Management
The aim of Air Traffic Flow Management (ATFM) is to enhance the capacity of the airspace while satisfying Air Traffic Control constraints and airlines requests to optimize their o...
Nicolas Barnier, Pascal Brisset