1188 search results - page 91 / 238 » Extended Graph Unification |
113
Voted
ESA
2010
Springer
15 years 1 months ago
2010
Springer
Motivated by the trend to outsource work to commercial cloud computing services, we consider a variation of the streaming paradigm where a streaming algorithm can be assisted by a...
105
Voted
DM
2008
15 years 27 days ago
2008
The chromatic capacity cap(G) of a graph G is the largest k for which there exists a k-coloring of the edges of G such that, for every coloring of the vertices of G with the same ...
107
click to vote
CORR
2006
Springer
15 years 25 days ago
2006
Springer
We investigate families of infinite automata for context-sensitive languages. An infinite automaton is an infinite labeled graph with two sets of initial and final vertices. Its la...
116
Voted
ISM
2006
IEEE
15 years 24 days ago
2006
IEEE
In this work, we propose new graph-based data model and indexing to organize and manage video data. To consider spatial and temporal characteristics of video, we introduce a new g...
113
Voted
JDA
2006
15 years 23 days ago
2006
Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wishes to partition G into connected components by del...