994 search results - page 168 / 199 » Custom Computing Machines for the Set Covering Problem |
STACS
1994
Springer
13 years 11 months ago
1994
Springer
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...
SAC
2008
ACM
13 years 6 months ago
2008
ACM
In this work we discuss author identification for documents written in Portuguese. Two different approaches were compared. The first is the writer-independent model which reduces ...
VRCAI
2009
ACM
14 years 1 months ago
2009
ACM
Game engines of cinematic quality, broadband networking and advances in Virtual Reality (VR) technologies are setting the stage to allow players to have shared, “better-than-lif...
TJS
2002
13 years 7 months ago
2002
Historically, compilers have operated by applying a fixed set of optimizations in a predetermined order. We call such an ordered list of optimizations a compilation sequence. This...
KDD
2009
ACM
14 years 8 months ago
2009
ACM
In recent years, the blogosphere has experienced a substantial increase in the number of posts published daily, forcing users to cope with information overload. The task of guidin...