Sciweavers

3211 search results - page 78 / 643
» On the Grundy Number of a Graph
Sort
View
CORR
2011
Springer
199views Education» more  CORR 2011»
13 years 2 months ago
Fast Sparse Matrix-Vector Multiplication on GPUs: Implications for Graph Mining
Scaling up the sparse matrix-vector multiplication kernel on modern Graphics Processing Units (GPU) has been at the heart of numerous studies in both academia and industry. In thi...
Xintian Yang, Srinivasan Parthasarathy, Ponnuswamy...
SWAT
2004
Springer
171views Algorithms» more  SWAT 2004»
14 years 1 months ago
Connectivity of Graphs Under Edge Flips
We study the following problem: Given a set V of n vertices and a set E of m edge pairs, we define a graph family G(V, E) as the set of graphs that have vertex set V and contain ...
Norbert Zeh
COLING
2010
13 years 2 months ago
A Linguistically Grounded Graph Model for Bilingual Lexicon Extraction
We present a new method, based on graph theory, for bilingual lexicon extraction without relying on resources with limited availability like parallel corpora. The graphs we use re...
Florian Laws, Lukas Michelbacher, Beate Dorow, Chr...
JGAA
2008
100views more  JGAA 2008»
13 years 7 months ago
Parameters of Bar k-Visibility Graphs
Bar k-visibility graphs are graphs admitting a representation in which the vertices correspond to horizontal line segments, called bars, and the edges correspond to vertical lines...
Stefan Felsner, Mareike Massow
ICASSP
2011
IEEE
12 years 11 months ago
Polytope kernel density estimates on Delaunay graphs
We present a polytope-kernel density estimation (PKDE) methodology that allows us to perform exact mean-shift updates along the edges of the Delaunay graph of the data. We discuss...
Erhan Bas, Deniz Erdogmus