16404 search results - page 88 / 3281 » A set coverage problem |
115
click to vote
COMPGEOM
2004
ACM
15 years 8 months ago
2004
ACM
Let P be a set of n points in Ê3 , not all in a common plane. We solve a problem of Scott (1970) by showing that the connecting lines of P assume at least 2n − 7 different dir...
112
click to vote
EDM
2009
15 years 27 days ago
2009
Researchers who make tutoring systems would like to know which sequences of educational content lead to the most effective learning by their students. The majority of data collecte...
105
click to vote
STACS
2010
Springer
15 years 10 months ago
2010
Springer
Using ε-bias spaces over F2, we show that the Remote Point Problem (RPP), introduced by Alon et al [APY09], has an NC2 algorithm (achieving the same parameters as [APY09]). We stu...
128
click to vote
COCOON
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. The infrastructure for mobile distributed tasks is often formed by cellular networks. One of the major issues in such networks is interference. In this paper we tackle in...
150
click to vote
ICTCS
2005
Springer
15 years 8 months ago
2005
Springer
This work introduces two decision problems, StabilizerD and Orbit CosetD, and gives quantum reductions from them to the problem Orbit Superposition (Friedl et al., 2003), as well a...