1066 search results - page 119 / 214 » Computing Private Set Operations with Linear Complexities |
CVPR
2012
IEEE
13 years 7 days ago
2012
IEEE
In this paper, we address a challenging image segmentation problem called multiple foreground cosegmentation (MFC), which concerns a realistic scenario in general Webuser photo se...
CPAIOR
2010
Springer
15 years 2 months ago
2010
Springer
In this paper, we present a constraint programming approach for the service consolidation problem that is being currently tackled by Neptuny, Milan. The problem is defined as: Giv...
GLOBECOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—We present the optimal relay-subset selection and transmission-time for a decode-and-forward, half-duplex cooperative network of arbitrary size. The resource allocation is obtai...
CPAIOR
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. This article first introduces an extension of the classical cumulative constraint: each task is no more a rectangle but rather a sequence of contiguous trapezoid sub-tas...
DAM
2011
14 years 4 months ago
2011
We present a collection of new structural, algorithmic, and complexity results for two types of matching problems. The first problem involves the computation of k-maximal matchin...