1445 search results - page 131 / 289 » Uniformly Hard Languages |
144
click to vote
TACS
2001
Springer
15 years 8 months ago
2001
Springer
Network programming is notoriously hard to understand: one has to deal with a variety of protocols (IP, ICMP, UDP, TCP etc), concurrency, packet loss, host failure, timeouts, the c...
141
Voted
ESOP
2009
Springer
15 years 8 months ago
2009
Springer
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...
114
click to vote
COLING
2010
14 years 11 months ago
2010
Word co-occurrence networks are one of the most common linguistic networks studied in the past and they are known to exhibit several interesting topological characteristics. In th...
148
click to vote
PAM
2012
Springer
13 years 11 months ago
2012
Springer
Network administrators are faced with the increasingly challenging task of monitoring their network’s health in real time, drawing upon diverse and voluminous measurement data fe...
165
Voted
CACM
1998
15 years 3 months ago
1998
abstraction for modeling these problems is to view the Web as a collection of (usually small and heterogeneous) databases, and to view programs that extract and process Web data au...