8647 search results - page 16 / 1730 » The Container Selection Problem |
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We present an algorithm running in time O(n log n) which decides if a wreathclosed permutation class Av(B) given by its finite basis B contains a finite number of simple permutati...
ICMCS
2007
IEEE
15 years 3 months ago
2007
IEEE
We propose a new method for performing accurate background subtraction in scenes with a door, like a building entrance or a hallway. This kind of scene is common in surveillance a...
CPAIOR
2008
Springer
14 years 11 months ago
2008
Springer
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
175
click to vote
ICDE
2007
IEEE
15 years 11 months ago
2007
IEEE
Estimating the selectivity of queries is a crucial problem in database systems. Virtually all database systems rely on the use of selectivity estimates to choose amongst the many ...
CP
2003
Springer
15 years 2 months ago
2003
Springer
We propose a two-level search strategy to solve a two dimensional circle packing problem. At the first level, a good enough packing algorithm called