694 search results - page 48 / 139 » Open Graphs and Computational Reasoning |
ENTCS
2008
15 years 26 days ago
2008
The well-known notion of critical pairs already allows a static conflict detection, which is important for all kinds of applications and already implemented in AGG. Unfortunately ...
117
click to vote
WLP
2004
Springer
15 years 6 months ago
2004
Springer
: The growing use of XML in commercial as well as non-commercial domains to transport information poses new challenges to concepts to access these information. Common ways to acces...
JGT
2007
15 years 1 months ago
2007
We introduce and study backbone colorings, a variation on classical vertex colorings: Given a graph G = (V, E) and a spanning subgraph H of G (the backbone of G), a backbone color...
102
click to vote
SIAMCOMP
2010
14 years 11 months ago
2010
Let G = (V, E) be a weighted undirected graph having non-negative edge weights. An estimate ˆδ(u, v) of the actual distance δ(u, v) between u, v ∈ V is said to be of stretch t...
116
click to vote
ICIP
2007
IEEE
15 years 5 months ago
2007
IEEE
The major problem in building a good lipreading system is to extract effective visual features from enormous quantity of video sequences data. For appearance-based feature analysi...