485 search results - page 5 / 97 » Easy Keys for OWL |
98
Voted
IPL
2006
15 years 23 days ago
2006
We present complexity results for the verification of security protocols. Since the perfect cryptography assumption is unrealistic for cryptographic primitives with visible algebr...
103
Voted
ESWS
2005
Springer
15 years 6 months ago
2005
Springer
The power of Web Service (WS) technology lies in the fact that it establishes a common, vendor-neutral platform for integrating distributed computing applications, in intranets as ...
105
Voted
SODA
2001
ACM
15 years 2 months ago
2001
ACM
We explore the natural question of whether all NP-complete problems have a common restriction under which they are polynomially solvable. More precisely, we study what languages a...
GRAPHICSINTERFACE
2003
15 years 2 months ago
2003
In this paper we reconsider pairwise collision detection for rigid motions using a k-DOP bounding volume hierarchy. This data structure is particularly attractive because it is eq...
127
Voted
CGI
2009
IEEE
15 years 4 months ago
2009
IEEE
Despite the clear benefits that stream and path surfaces bring when visualizing 3D vector fields, their use in both industry and for research has not proliferated. This is due, in...