Sciweavers

648 search results - page 29 / 130
» Simple Algorithms for a Weighted Interval Selection Problem
Sort
View
FOCS
2002
IEEE
14 years 20 days ago
Covering Problems with Hard Capacities
We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its...
Julia Chuzhoy, Joseph Naor
ML
2010
ACM
119views Machine Learning» more  ML 2010»
13 years 6 months ago
A cooperative coevolutionary algorithm for instance selection for instance-based learning
This paper presents a cooperative evolutionary approach for the problem of instance selection for instance based learning. The presented model takes advantage of one of the most r...
Nicolás García-Pedrajas, Juan Antoni...
CVPR
2012
IEEE
11 years 10 months ago
Maximum weight cliques with mutex constraints for video object segmentation
In this paper, we address the problem of video object segmentation, which is to automatically identify the primary object and segment the object out in every frame. We propose a n...
Tianyang Ma, Longin Jan Latecki
ICIP
2005
IEEE
14 years 9 months ago
Off-line multiple object tracking using candidate selection and the Viterbi algorithm
This paper presents a probabilistic framework for off-line multiple object tracking. At each timestep, a small set of deterministic candidates is generated which is guaranteed to ...
Anil C. Kokaram, François Pitié, Roz...
JCIT
2010
160views more  JCIT 2010»
13 years 2 months ago
TOPSIS Method for Multiple Attribute Decision Making with Incomplete Weight Information in Linguistic Setting
The aim of this paper is to investigate the multiple attribute decision making problems with linguistic information, in which the information about attribute weights is incomplete...
Jianli Wei