Sciweavers

485 search results - page 5 / 97
» Easy Keys for OWL
Sort
View
IPL
2006
118views more  IPL 2006»
13 years 7 months ago
Easy intruder deduction problems with homomorphisms
We present complexity results for the verification of security protocols. Since the perfect cryptography assumption is unrealistic for cryptographic primitives with visible algebr...
Stéphanie Delaune
ESWS
2005
Springer
14 years 19 days ago
The OWL-S Editor - A Development Tool for Semantic Web Services
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 ...
Daniel Elenius, Grit Denker, David Martin, Fred Gi...
SODA
2001
ACM
92views Algorithms» more  SODA 2001»
13 years 8 months ago
On universally easy classes for NP-complete problems
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...
Erik D. Demaine, Alejandro López-Ortiz, J. ...
GRAPHICSINTERFACE
2003
13 years 8 months ago
Easy Realignment of k-DOP Bounding Volumes
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...
Christoph Fünfzig, Dieter W. Fellner
CGI
2009
IEEE
13 years 11 months ago
Easy integral surfaces: a fast, quad-based stream and path surface algorithm
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...
Tony McLoughlin, Robert S. Laramee, Eugene Zhang