4744 search results - page 219 / 949 » Connected Computing |
128
Voted
CSR
2008
Springer
15 years 5 months ago
2008
Springer
A function f of a graph is called a complete graph invariant if two given graphs G and H are isomorphic exactly when f(G) = f(H). If additionally, f(G) is a graph isomorphic to G, ...
117
Voted
CAISE
2007
Springer
15 years 9 months ago
2007
Springer
In distributed work environments, where users are sharing and searching resources, ensuring an appropriate ranking at remote peers is a key problem. While this issue has been inves...
149
Voted
IAW
2003
IEEE
15 years 9 months ago
2003
IEEE
– Computer Networks connected to the Internet continue to be compromised and exploited by hackers. This is in spite of the fact that many networks run some type of security mecha...
128
Voted
SPIN
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We present an approach for the veri cation of spatial properties with Spin. We rst extend one of Spin's main property speci cation mechanisms, i.e., the linear-time...
139
Voted
CCECE
2006
IEEE
15 years 9 months ago
2006
IEEE
Due to financial losses caused by Distributed Denial of Service (DDoS) attacks, most defence mechanisms have been deployed at the network where the target server is located. We be...