Results 1  10
of
1,494,097
Consistent labeling of rotating maps
 Int. Symp. Algorithms & Data Structures (WADS’11), volume 6844 of LNCS
, 2011
"... Abstract. Dynamic maps that allow continuous map rotations, e.g., on mobile devices, encounter new issues unseen in static map labeling before. We study the following dynamic map labeling problem: The input is a static, labeled map, i.e., a set P of points in the plane with attached nonoverlapping ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
overlapping horizontal rectangular labels. The goal is to find a consistent labeling of P under rotation that maximizes the number of visible labels for all rotation angles such that the labels remain horizontal while the map is rotated. A labeling is consistent if a single active interval of angles is selected for each
The Consistent Labeling Problem: Part I
 IEEE Trans. Pattern Anal. Mach. Intell
, 1979
"... AbstractIn this first part of a twopart paper we introduce a general consistent labeling problem based on a unit constraint relation T containing Ntuples of units which constrain one another, and a compatibility relation R containing Ntuples of unitlabel pairs specifying which Ntuples of uni ..."
Abstract

Cited by 33 (3 self)
 Add to MetaCart
AbstractIn this first part of a twopart paper we introduce a general consistent labeling problem based on a unit constraint relation T containing Ntuples of units which constrain one another, and a compatibility relation R containing Ntuples of unitlabel pairs specifying which N
A Consistent Labeling Algorithm
, 1994
"... The Rapidly Deployable Radio Network #RDRN# is an Advanced Research Projects Agency #ARPA# grantawarded to the University of Kansas's Telecommunications and Information Sciences Laboratory #TISL#. The goal of this project is to develop a portable high speed wireless communications network that ..."
Abstract
 Add to MetaCart
The Rapidly Deployable Radio Network #RDRN# is an Advanced Research Projects Agency #ARPA# grantawarded to the University of Kansas's Telecommunications and Information Sciences Laboratory #TISL#. The goal of this project is to develop a portable high speed wireless communications network that could easily be deployed in a time of battle or emergency.
17. The ConsistentLabeling Problem
"... O ce Hours: Thursday 3PM5PM Objective: To learn computer and robot vision through extensive course projects. ..."
Abstract
 Add to MetaCart
O ce Hours: Thursday 3PM5PM Objective: To learn computer and robot vision through extensive course projects.
The Consistent Labeling Problem: Part 11
"... AbstractIn this second part of a twopart paper, we explore the power and complexity of the 'kKP and 'KP class of lookahead operators which can be used to speed up the tree search in the consistent labeling problem. For a specified K and P we show that the fixedpoint power of PKP and & ..."
Abstract
 Add to MetaCart
AbstractIn this second part of a twopart paper, we explore the power and complexity of the 'kKP and 'KP class of lookahead operators which can be used to speed up the tree search in the consistent labeling problem. For a specified K and P we show that the fixedpoint power of PKP
Metric Clustering via Consistent Labeling
, 2008
"... We design approximation algorithms for a number of fundamental optimization problems in metric spaces, namely computing separating and padded decompositions, sparse covers, and metric triangulations. Our work is the first to emphasize relative guarantees that compare the produced solution to the opt ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
guarantees, using a rather different algorithm. Our technical approach is to cast a number of metric clustering problems that have been well studied—but almost always as disparate problems—into a common modeling and algorithmic framework, which we call the consistent labeling problem. Having identified
Learning with local and global consistency
 Advances in Neural Information Processing Systems 16
, 2004
"... We consider the general problem of learning from labeled and unlabeled data, which is often called semisupervised learning or transductive inference. A principled approach to semisupervised learning is to design a classifying function which is sufficiently smooth with respect to the intrinsic stru ..."
Abstract

Cited by 666 (21 self)
 Add to MetaCart
We consider the general problem of learning from labeled and unlabeled data, which is often called semisupervised learning or transductive inference. A principled approach to semisupervised learning is to design a classifying function which is sufficiently smooth with respect to the intrinsic
A Class of Solvable Consistent Labeling Problems
, 2000
"... The structural description ansatz often used for representing and recognizing complex objects leads to the consistent labeling problem or to some optimization problems on labeled graphs. Although this problems are NPcomplete in general it is well known that they are easy solvable if the underlying ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
The structural description ansatz often used for representing and recognizing complex objects leads to the consistent labeling problem or to some optimization problems on labeled graphs. Although this problems are NPcomplete in general it is well known that they are easy solvable if the underlying
Consistent Labeling of Tracked Objects in Multiple Cameras with Overlapping Fields of View
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 2003
"... In this paper, we address the issue of tracking moving objects in an environment covered by multiple uncalibrated cameras with overlapping fields of view, typical of most surveillance setups. In such a scenario, it is essential to establish correspondence between tracks of the same object, seen in d ..."
Abstract

Cited by 122 (3 self)
 Add to MetaCart
in di#erent cameras, to recover complete information about the object. We call this the problem of consistent labeling of objects when seen in multiple cameras. We employ a novel approach of finding the limits of field of view (FOV) of each camera as visible in the other cameras. We show that if the FOV
Results 1  10
of
1,494,097