4266 search results - page 332 / 854 » The container loading problem |
172
Voted
ICCV
2011
IEEE
14 years 5 months ago
2011
IEEE
In this paper, we show that tracking multiple people whose paths may intersect can be formulated as a convex global optimization problem. Our proposed framework is designed to exp...
164
click to vote
AAAI
2011
14 years 5 months ago
2011
In environmental and natural resource planning domains actions are taken at a large number of locations over multiple time periods. These problems have enormous state and action s...
164
click to vote
CANS
2011
Springer
14 years 5 months ago
2011
Springer
In this paper, we explore fast algorithms for computing on encrypted polynomials. More specifically, we describe efficient algorithms for computing the Discrete Fourier Transform,...
166
click to vote
JMLR
2012
13 years 7 months ago
2012
Often, high dimensional data lie close to a low-dimensional submanifold and it is of interest to understand the geometry of these submanifolds. The homology groups of a manifold a...
230
click to vote
VLDB
2006
ACM
16 years 5 months ago
2006
ACM
In this paper we study the following problem. Given a database and a set of queries, we want to find a set of views that can compute the answers to the queries, such that the amoun...