The efficiency of graph-based semi-supervised algorithms depends on the graph of instances on which they are applied. The instances are often in a vectorial form before a graph linking them is built. The construction of the graph relies on a metric over the vectorial space that help define the weight of the connection between entities. The classic choice for this metric is usually a distance me...

background recombinant activated factor vii (rfviia; novoseven® rt, novo nordisk, bagsvaerd, denmark) is a synthetic pro-coagulation factor derived from hamster kidney cells. objectives the purpose of this study was to evaluate the prescribing patterns of recombinant factor viia (rfviia) at a single, tertiary care pediatric hospital by indication of usage and dose administered. materials and me...

In this paper, we present a novel probabilistic label enhancement model to tackle multi-label image classification problem. Recognizing multiple objects in images is a challenging problem due to label sparsity, appearance variations of the objects and occlusions. We propose to tackle these difficulties from a novel perspective by constructing auxiliary labels in the output space. Our idea is to...

labeling theory is one of the most famous theories in criminology domain. the pivots of this theory consist of the role of power owners in definition of crime and determination of offender, effects of labeling and solutions for prevention of entering label. with study the pivots of labeling theory in islamic sources, we observe that however there is no similarity between religious bases and bas...

altan derivatives of polycyclic conjugated hydrocarbons were recently introduced and studied in theoretical organic chemistry. we now provide a generalization of the altan concept, applicable to any graph. several earlier noticed topological properties of altan derivatives of polycyclic conjugated hydrocarbons are shown to be the properties of all altan derivatives of all graphs. among these ar...

Many tasks in computer vision involve assigning a label (such as disparity) to every pixel. These tasks can be formulated as energy minimization problems. In this paper, we consider a natural class of energy functions that permits discontinuities. Computing the exact minimum is NP-hard. We have developed two approximation algorithms based on graph cuts. These algorithms find a local minimum of ...

Deciding whether a collection of unrooted trees is compatible is a fundamental problem in phylogenetics. Two different graph-theoretic characterizations of tree compatibility have recently been proposed. In one of these, tree compatibility is characterized in terms of the existence of a specific kind of triangulation in a structure known as the display graph. An alternative characterization exp...

Many computer vision applications such as image filtering, segmentation and stereovision can be formulated as optimization problems. Recently discrete, convex, globally optimal methods have received a lot of attention. Many graph-based methods suffer from metrication artifacts. Segmented contours are blocky in areas where contour information is lacking. In Chapter 2, we develop a discrete yet i...

label switching technology is a flexible and high performance method for forwarding layer three packets that are mapped to layer two flows. each label switch router, lsr, needs a specific label for every flow, where the number of labels depends on the mapping and granularity of flows. data and control driven methods are the most significant and popular methods in label mapping policy. the above...

In this paper, we address the scalability issue plaguing graph-based semi-supervised learning via a small number of anchor points which adequately cover the entire point cloud. Critically, these anchor points enable nonparametric regression that predicts the label for each data point as a locally weighted average of the labels on anchor points. Because conventional graph construction is ineffic...