1404 search results - page 196 / 281 » On General Laws of Complex Networks |
156
click to vote
CONEXT
2007
ACM
15 years 8 months ago
2007
ACM
Deterministic finite automata (DFAs) are widely used to perform regular expression matching in linear time. Several techniques have been proposed to compress DFAs in order to redu...
148
click to vote
GI
2009
Springer
15 years 8 months ago
2009
Springer
: Large traffic network systems require handling huge amounts of data, often distributed over a large geographical region in space and time. Centralised processing is not then the ...
133
click to vote
LISA
2007
15 years 7 months ago
2007
Firewalls have an important role in network security. However, managing firewall policies is an extremely complex task because the large number of interacting rules in single or d...
143
click to vote
UAI
2003
15 years 6 months ago
2003
Currently, there is renewed interest in the problem, raised by Shafer in 1985, of updating probabilities when observations are incomplete (or setvalued). This is a fundamental pro...
119
click to vote
IJCAI
1997
15 years 6 months ago
1997
This paper studies constraint satisfaction over connected row-convex (CRC) constraints. It shows that CRC constraints are closed under composition, intersection, and transposition...