In this work we consider the task of relaxing the i.i.d. assumption in pattern recognition (or classification), aiming to make existing learning algorithms applicable to a wider r...
An optimal labeling where labels are disjoint axis-parallel equal-size squares is called 2PM labeling if the labels have maximum length each attached to its corresponding point on...
Farshad Rostamabadi, Iman Sadeghi, Mohammad Ghodsi...
We examine the power and limitations of the weakest vertex relabelling system which allows to change a label of a vertex in function of its own label and of the label of one of its...
Given a graph G, a function f : V (G) {1, 2, . . . , k} is a k-ranking of G if f (u) = f (v) implies every u - v path contains a vertex w such that f (w) > f (u). A k-ranking ...
Victor Kostyuk, Darren A. Narayan, Victoria A. Wil...
An L(h, k)-labeling of a graph G is an integer labeling of vertices of G, such that adjacent vertices have labels which differ by at least h, and vertices at distance two have lab...
Tiziana Calamoneri, Andrzej Pelc, Rossella Petresc...
Internet IP networks utilize multiple-protocol label switching (MPLS), which provides a reliable label switched path (LSP). LSP in MPLS domains needs one label at each Ingress lab...
Abstract-Requirement: Clients should experience high-availability when accessing network services. Availability should be transparent and not require altering programs. Problem: Av...
We present an algorithm for unsupervised induction of labeled parse trees. The algorithm has three stages: bracketing, initial labeling, and label clustering. Bracketing is done f...
Labelled tableaux are extensions of semantic tableaux with annotations (labels, indices) whose main function is to enrich the modal object language with semantic elements. This pap...
Supervised learning deals with the inference of a distribution over an output or label space Y conditioned on points in an observation space X , given a training dataset D of pair...