372 search results - page 12 / 75 » The box mover problem |
141
Voted
FCT
2005
Springer
15 years 7 months ago
2005
Springer
We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ...
92
Voted
SEKE
2004
Springer
15 years 7 months ago
2004
Springer
Development of a software system from existing components can surely have various benefits, but can also entail a series of problems. One type of problems is caused by a limited ...
121
Voted
CRYPTO
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
107
Voted
AUTOMATICA
2008
15 years 1 months ago
2008
In recent years particle ...lters have been applied to a variety of state estimation problems. A particle ...lter is a sequential Monte Carlo Bayesian estimator of the posterior d...
COMPGEOM
2004
ACM
15 years 7 months ago
2004
ACM
We consider the problem of constructing binary space partitions (BSPs) for orthogonal subdivisions (space filling packings of boxes) in d-space. We show that a subdivision with n...