650 search results - page 75 / 130 » Positive graphs |
SEMWEB
2009
Springer
14 years 4 months ago
2009
Springer
Linked open data offers a set of design patterns and conventions for sharing data across the semantic web. In this position paper we enumerate some key uncertainty representation i...
GC
2008
Springer
13 years 10 months ago
2008
Springer
A spanning subgraph H of a graph G is a 2-detour subgraph of G if for each x, y V (G), dH (x, y) dG(x, y) + 2. We prove a conjecture of Erdos, Hamburger, Pippert, and Weakley by ...
CVPR
2007
IEEE
14 years 12 months ago
2007
IEEE
The goal of this paper is to find sparse and representative spatial priors that can be applied to part-based object localization. Assuming a GMRF prior over part configurations, w...
IWPEC
2009
Springer
14 years 4 months ago
2009
Springer
Given a graph G together with a capacity function c : V (G) → N, we call S ⊆ V (G) a capacitated dominating set if there exists a mapping f : (V (G) \ S) → S which maps every...
COCOA
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. We study the complexity of several coloring problems on graphs, parameterized by the treewidth t of the graph: (1) The list chromatic number χl(G) of a graph G is defin...