1120 search results - page 35 / 224 » Making computer science minority-friendly |
MFCS
1994
Springer
15 years 3 months ago
1994
Springer
We introduce the notion of empty alternation by investigating alternating automata which are restricted to empty their storage except for a logarithmically space-bounded tape befor...
GI
2007
Springer
15 years 3 months ago
2007
Springer
: The decomposition of planning and scheduling problems is a well known technique to make these problems tractable. The resulting dependable subproblems were often solved using dif...
FOCS
1998
IEEE
15 years 3 months ago
1998
IEEE
It is known that there exists a PCP characterization of NP where the verifier makes 3 queries and has a onesided error that is bounded away from 1; and also that 2 queries do not ...
FOCS
1998
IEEE
15 years 3 months ago
1998
IEEE
A recommendation system tracks past actions of a group of users to make recommendations toindividualmembersofthe group. The growth ofcomputer-mediatedmarketingandcommerce has led ...
ACM
1987
15 years 3 months ago
1987
Balanced codes have the property that no codeword is "contained" in another.This property makes balanced codes attractive for certain applications, such as the encoding ...