458 search results - page 10 / 92 » Totally magic graphs |
ICCV
2009
IEEE
15 years 1 months ago
2009
IEEE
One of the key factors for the success of recent energy
minimization methods is that they seek to compute global
solutions. Even for non-convex energy functionals, optimization
...
DAM
2008
13 years 8 months ago
2008
Abstract. A graph is called equistable when there is a nonnegative weight function on its vertices such that a set S of vertices has total weight 1 if and only if S is maximal stab...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
We study frequency allocation in wireless networks. A wireless network is modeled by an undirected graph, with vertices corresponding to cells. In each vertex we have a certain nu...
CRYPTO
2012
Springer
11 years 11 months ago
2012
Springer
A secret-sharing scheme realizes a graph if every two vertices connected by an edge can reconstruct the secret while every independent set in the graph does not get any informatio...
SEMWEB
2009
Springer
14 years 3 months ago
2009
Springer
RDF Schema (RDFS) as a lightweight ontology language is gaining popularity and, consequently, tools for scalable RDFS inference and querying are needed. SPARQL has become recently ...