Results 1  10
of
1,918,036
On the RedBlue Set Cover Problem
 In Proceedings of the 11th Annual ACMSIAM Symposium on Discrete Algorithms
, 2000
"... Given a finite set of "red" elements R, a finite set of "blue" elements B and a family S ` 2 R[B , the redblue set cover problem is to find a subfamily C ` S which covers all blue elements, but which covers the minimum possible number of red elements. We note that RedBlue Se ..."
Abstract

Cited by 48 (0 self)
 Add to MetaCart
Given a finite set of "red" elements R, a finite set of "blue" elements B and a family S ` 2 R[B , the redblue set cover problem is to find a subfamily C ` S which covers all blue elements, but which covers the minimum possible number of red elements. We note that RedBlue
Approximation algorithms for the labelcovermax and redblue set cover problems
 J. of Discrete Algorithms
"... This paper presents approximation algorithms for two extensions of the set cover problem: a graphbased extension known as the MaxRep or LabelCoverMAXproblem, and a colorbased extension known as the RedBlue Set Cover problem. First, a randomized algorithm guaranteeing approximation ratio √ n wit ..."
Abstract

Cited by 22 (1 self)
 Add to MetaCart
This paper presents approximation algorithms for two extensions of the set cover problem: a graphbased extension known as the MaxRep or LabelCoverMAXproblem, and a colorbased extension known as the RedBlue Set Cover problem. First, a randomized algorithm guaranteeing approximation ratio √ n
Geometric RedBlue Set Cover for Unit Squares and Related Problems
"... We study a geometric version of the RedBlue Set Cover problem originally proposed by Carr, Doddi, Konjevod, and Marathe (SODA 2000): given a red point set, a blue point set, and a set of objects, we want to use objects to cover all the blue points, while minimizing the number of red points covered. ..."
Abstract
 Add to MetaCart
We study a geometric version of the RedBlue Set Cover problem originally proposed by Carr, Doddi, Konjevod, and Marathe (SODA 2000): given a red point set, a blue point set, and a set of objects, we want to use objects to cover all the blue points, while minimizing the number of red points covered
RedBlue Covering Problems and the Consecutive Ones Property
, 2007
"... Set Cover problems are of core importance in many applications. In recent research, the “redblue variants” where blue elements all need to be covered whereas red elements add further constraints on the optimality of a covering have received considerable interest. Application scenarios range from da ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Set Cover problems are of core importance in many applications. In recent research, the “redblue variants” where blue elements all need to be covered whereas red elements add further constraints on the optimality of a covering have received considerable interest. Application scenarios range from
A Threshold of ln n for Approximating Set Cover
 JOURNAL OF THE ACM
, 1998
"... Given a collection F of subsets of S = f1; : : : ; ng, set cover is the problem of selecting as few as possible subsets from F such that their union covers S, and max kcover is the problem of selecting k subsets from F such that their union has maximum cardinality. Both these problems are NPhar ..."
Abstract

Cited by 778 (5 self)
 Add to MetaCart
Given a collection F of subsets of S = f1; : : : ; ng, set cover is the problem of selecting as few as possible subsets from F such that their union covers S, and max kcover is the problem of selecting k subsets from F such that their union has maximum cardinality. Both these problems are NP
The Hungarian method for the assignment problem
 Naval Res. Logist. Quart
, 1955
"... Assuming that numerical scores are available for the performance of each of n persons on each of n jobs, the "assignment problem" is the quest for an assignment of persons to jobs so that the sum of the n scores so obtained is as large as possible. It is shown that ideas latent in the work ..."
Abstract

Cited by 1238 (0 self)
 Add to MetaCart
Assuming that numerical scores are available for the performance of each of n persons on each of n jobs, the "assignment problem" is the quest for an assignment of persons to jobs so that the sum of the n scores so obtained is as large as possible. It is shown that ideas latent
The Vocabulary Problem in HumanSystem Communication
 COMMUNICATIONS OF THE ACM
, 1987
"... In almost all computer applications, users must enter correct words for the desired objects or actions. For success without extensive training, or in firsttries for new targets, the system must recognize terms that will be chosen spontaneously. We studied spontaneous word choice for objects in five ..."
Abstract

Cited by 551 (8 self)
 Add to MetaCart
In almost all computer applications, users must enter correct words for the desired objects or actions. For success without extensive training, or in firsttries for new targets, the system must recognize terms that will be chosen spontaneously. We studied spontaneous word choice for objects in five applicationrelated domains, and found the variability to be surprisingly large. In every case two people favored the same term with probability <0.20. Simulations show how this fundamental property of language limits the success of various design methodologies for vocabularydriven interaction. For example, the popular approach in which access is via one designer's favorite single word will result in 8090 percent failure rates in many common situations. An optimal strategy, unlimited aliasing, is derived and shown to be capable of severalfold improvements.
Red–blue plots for detecting clusters in count data
 Ecology Letters
, 1999
"... BIOSKETCH: Joe Perry has worked at Rothamsted Experimental Station for 22 years, firstly in the Department of Statistics, then in Entomology & Nematology. His research interests cross these disciplines; he is particularly interested in spatial pattern and population modelling. 2ABSTRACT A new in ..."
Abstract

Cited by 24 (1 self)
 Add to MetaCart
index and four new graphical displays, termed ‘redblue ’ plots, are presented to study and measure clustering in spatiallyreferenced count data. The index can detect clusters in the form of patches, comprising several nearby large counts, and in the form of gaps, comprising several nearby small counts
Shape modeling with front propagation: A level set approach
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 1995
"... Abstract Shape modeling is an important constituent of computer vision as well as computer graphics research. Shape models aid the tasks of object representation and recognition. This paper presents a new approach to shape modeling which retains some of the attractive features of existing methods ..."
Abstract

Cited by 804 (20 self)
 Add to MetaCart
secting, hypersurface flowing along its gradient field with constant speed or a speed that depends on the curvature. It is moved by solving a “HamiltonJacob? ’ type equation written for a function in which the interface is a particular level set. A speed term synthesizpd from the image is used to stop the interface
Results 1  10
of
1,918,036