923 search results - page 170 / 185 » Factorizing Languages |
SIGSOFT
2006
ACM
14 years 10 months ago
2006
ACM
Fixing runtime bugs in long running programs using trace based analyses such as dynamic slicing was believed to be prohibitively expensive. In this paper, we present a novel execu...
WWW
2007
ACM
14 years 10 months ago
2007
ACM
Web sites are designed for graphical mode of interaction. Sighted users can "cut to the chase" and quickly identify relevant information in Web pages. On the contrary, i...
WWW
2001
ACM
14 years 10 months ago
2001
ACM
The virtual laboratories enhance learning experiences by providing the student with a supplement to the physical lab. The laboratories allow students to perform exercises as in an...
STOC
2006
ACM
14 years 10 months ago
2006
ACM
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
ICALP
2009
Springer
14 years 10 months ago
2009
Springer
We study the cover time of multiple random walks. Given a graph G of n vertices, assume that k independent random walks start from the same vertex. The parameter of interest is the...