927 search results - page 150 / 186 » Detection of Simple Plagiarism in Computer Science Papers |
123
click to vote
MFCS
2009
Springer
15 years 11 months ago
2009
Springer
We introduce the tree evaluation problem, show that it is in LogDCFL (and hence in P), and study its branching program complexity in the hope of eventually proving a superlogarith...
222
click to vote
SIGCSE
2006
ACM
15 years 10 months ago
2006
ACM
Traditionally, the topics of compiler construction and language processing have been taught as an elective course in Computer Science curricula. As such, students may graduate wit...
132
click to vote
ACSC
2002
IEEE
15 years 9 months ago
2002
IEEE
HyperScout, a Web application, is an intermediary between a server and a client. It intercepts a page to the client, gathers information on each link, and annotates each link with...
155
click to vote
FOCS
2000
IEEE
15 years 8 months ago
2000
IEEE
Extractors (defined by Nisan and Zuckerman) are procedures that use a small number of truly random bits (called the seed) to extract many (almost) truly random bits from arbitrar...
131
click to vote
STACS
1999
Springer
15 years 8 months ago
1999
Springer
Model checking is a method for the verification of systems with respect to their specifications. Symbolic model-checking, which enables the verification of large systems, procee...