Results 1  10
of
1,674
Binary labelings for bipartite graphs
, 2007
"... Part of the authors introduced in [C. Huemer, S. Kappes, A binary labelling for plane Laman graphs and quadrangulations, in Proceedings of the 22nd European Workshop on Computational Geometry 83–86, 2006] a binary labeling for the angles of plane quadrangulations, similar to Schnyder labelings of th ..."
Abstract
 Add to MetaCart
Part of the authors introduced in [C. Huemer, S. Kappes, A binary labelling for plane Laman graphs and quadrangulations, in Proceedings of the 22nd European Workshop on Computational Geometry 83–86, 2006] a binary labeling for the angles of plane quadrangulations, similar to Schnyder labelings
ENERGY OF BINARY LABELED GRAPHS
, 2013
"... Let G be a graph with vertex set V (G) and edge set X(G) and consider the set A = {0, 1}. A mapping l: V (G) − → A is called binary vertex labeling of G and l(v) is called the label of the vertex v under l. In this paper we introduce a new kind of graph energy for the binary labeled graph, the lab ..."
Abstract
 Add to MetaCart
Let G be a graph with vertex set V (G) and edge set X(G) and consider the set A = {0, 1}. A mapping l: V (G) − → A is called binary vertex labeling of G and l(v) is called the label of the vertex v under l. In this paper we introduce a new kind of graph energy for the binary labeled graph
Binary labelings for plane quadrangulations and their relatives
, 2008
"... Motivated by the bijection between Schnyder labelings of a plane triangulation and partitions of its inner edges into three trees, we look for binary labelings for quadrangulations (whose edges can be partitioned into two trees). Our labeling resembles many of the properties of Schnyder’s one for tr ..."
Abstract

Cited by 13 (8 self)
 Add to MetaCart
Motivated by the bijection between Schnyder labelings of a plane triangulation and partitions of its inner edges into three trees, we look for binary labelings for quadrangulations (whose edges can be partitioned into two trees). Our labeling resembles many of the properties of Schnyder’s one
Optimal Signal Sets and Binary Labelings
"... ©2011 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other wo ..."
Abstract
 Add to MetaCart
©2011 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
A binary labelling for plane Laman graphs and quadrangulations
, 2008
"... We present binary labelings for the angles of quadrangulations and plane Laman graphs, which are in analogy with Schnyder labelings for triangulations [W. Schnyder, Proc. 1st ACMSIAM Symposium on Discrete Algorithms, 1990] and imply a special tree decomposition for quadrangulations. In particular, ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
We present binary labelings for the angles of quadrangulations and plane Laman graphs, which are in analogy with Schnyder labelings for triangulations [W. Schnyder, Proc. 1st ACMSIAM Symposium on Discrete Algorithms, 1990] and imply a special tree decomposition for quadrangulations. In particular
Online Learning a Binary Labeling of a Graph
"... We investigate the problem of online learning a binary labeling of the vertices for a given graph. We design an algorithm, Majority, to solve the problem and show its optimality on clique graphs. For general graphs we derive a relevant mistake bound that relates the algorithm’s performance to the cu ..."
Abstract
 Add to MetaCart
We investigate the problem of online learning a binary labeling of the vertices for a given graph. We design an algorithm, Majority, to solve the problem and show its optimality on clique graphs. For general graphs we derive a relevant mistake bound that relates the algorithm’s performance
What energy functions can be minimized via graph cuts?
 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 2004
"... In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in computer vision. Each of these techniques constructs a graph such that the minimum cut on the graph also minimizes the energy. Yet, because these graph constructions are co ..."
Abstract

Cited by 1047 (23 self)
 Add to MetaCart
are complex and highly specific to a particular energy function, graph cuts have seen limited application to date. In this paper, we give a characterization of the energy functions that can be minimized by graph cuts. Our results are restricted to functions of binary variables. However, our work generalizes
TWIX: Twig Structure and Content Matching of Selective Queries using Binary Labeling
"... Abstract — XML queries specify predicates on the content and the structure of the elements of treestructured XML documents. Hence, discovering the occurrences of twig (tree structure) query patterns is a core operation for XML query processing. In this paper, we propose a novel technique for matchi ..."
Abstract
 Add to MetaCart
for matching XML twig query patterns, named TWIX, which results in a substantial reduction of the search space, response time, size and structure invariance through a distributed binary labeling and tree traversal algorithm. Furthermore, TWIX benefits from an interactive graphical user interface for twig query
reports/896 Online Learning a Binary Labeling of a Graph
"... We investigate the problem of online learning a binary labeling of the vertices for a given graph. We design an algorithm, Majority, to solve the problem and show its optimality on clique graphs. For general graphs we derive a relevant mistake bound that relates the algorithm’s performance to the cu ..."
Abstract
 Add to MetaCart
We investigate the problem of online learning a binary labeling of the vertices for a given graph. We design an algorithm, Majority, to solve the problem and show its optimality on clique graphs. For general graphs we derive a relevant mistake bound that relates the algorithm’s performance
Anomaly Detection in Binary Labelled Point Data Using the Spatial Scan Statistic
"... Abstract. This paper presents a novel modification to an existing algorithm for spatial anomaly detection in binary labeled point data sets, using the Bernoulli version of the Spatial Scan Statistic. We identify a potential ambiguity in pvalues produced by Monte Carlo testing, which (by the selec ..."
Abstract
 Add to MetaCart
Abstract. This paper presents a novel modification to an existing algorithm for spatial anomaly detection in binary labeled point data sets, using the Bernoulli version of the Spatial Scan Statistic. We identify a potential ambiguity in pvalues produced by Monte Carlo testing, which (by
Results 1  10
of
1,674