451 search results - page 68 / 91 » Some Lower Bounds on Geometric Separability Problems |
SOFSEM
2012
Springer
13 years 5 months ago
2012
Springer
The classical group testing problem asks to determine at most d defective elements in a set of n elements, by queries to subsets that return Yes if the subset contains some defecti...
AIPS
2010
14 years 12 months ago
2010
Computing a good policy in stochastic uncertain environments with unknown dynamics and reward model parameters is a challenging task. In a number of domains, ranging from space ro...
ICCAD
2000
IEEE
15 years 2 months ago
2000
IEEE
–An FPGA switch box is said to be hyper-universal if it is routable for all possible surrounding multi-pin net topologies satisfying the routing resource constraints. It is desir...
KDD
2009
ACM
15 years 4 months ago
2009
ACM
In this paper we propose a utility model that accounts for both sales and branding advertisers. We first study the computational complexity of optimization problems related to bo...
ROBOCUP
2004
Springer
15 years 3 months ago
2004
Springer
We show that all published visual data processing methods for the simulated robotic soccer so far were not utilizing all available information, because they were mainly based on he...