2254 search results - page 204 / 451 » Computing the minimal covering set |
200
click to vote
ISVC
2009
Springer
15 years 11 months ago
2009
Springer
Foregrounds extracted from the background, which are intended to be used as photorealistic avatars for simulators in a variety of virtual worlds, should satisfy the following four ...
186
click to vote
AMW
2009
15 years 7 months ago
2009
Abstract. A Data Warehouse (DW) is a data repository that organizes and physically integrates data from multiple sources under special kinds of schemas. A DW is composed by a set o...
134
click to vote
JNSM
2008
15 years 6 months ago
2008
1 In this paper we address the problem of selecting probe station locations from where probes can be sent to monitor all the nodes in the network. Probe station placement involves...
204
click to vote
PAMI
2011
15 years 1 months ago
2011
—A novel framework is proposed for the design of cost-sensitive boosting algorithms. The framework is based on the identification of two necessary conditions for optimal cost-sen...
183
click to vote
COCO
2004
Springer
15 years 10 months ago
2004
Springer
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...