33 search results - page 3 / 7 » On the Positive-Negative Partial Set Cover problem |
NIPS
2007
13 years 6 months ago
2007
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...
IVC
2007
13 years 4 months ago
2007
This paper presents a solution to the cloud removal problem, based in a recently developed image fusion methodology consisting in applying a 1-D pseudo-Wigner distribution (PWD) t...
SDM
2008
SIAM
13 years 6 months ago
2008
SIAM
Although clustering under constraints is a current research topic, a hierarchical setting, in which a hierarchy of clusters is the goal, is usually not considered. This paper trie...
TCS
2010
13 years 3 months ago
2010
The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of disconnected cliq...
ICCAD
2005
IEEE
14 years 1 months ago
2005
IEEE
— In this paper we propose an exact algorithm that maximizes the sharing of partial terms in Multiple Constant Multiplication (MCM) operations. We model this problem as a Boolean...