2125 search results - page 181 / 425 » On Graph Complexity |
103
click to vote
FSTTCS
2008
Springer
15 years 4 months ago
2008
Springer
We consider an extension of Church’s synthesis problem to ordinals by adding limit transitions to graph games. We consider game arenas where these limit transitions are defined...
118
click to vote
ICASSP
2010
IEEE
15 years 3 months ago
2010
IEEE
Recently, the Sparse Matrix Transform (SMT) has been proposed as a tool for estimating the eigen-decomposition of high dimensional data vectors [1]. The SMT approach has two major...
112
Voted
DAM
2008
15 years 3 months ago
2008
Let G = (V, E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign a color (a number chosen in {1, . . . , k}) to each vertex of G so that no edge has...
134
click to vote
JMLR
2006
15 years 3 months ago
2006
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...
130
click to vote
VLC
2002
15 years 2 months ago
2002
More powerful personal computers and higher network bandwidth has meant that graphics has become increasingly important on the web. Graph-based diagrams are one of the most import...