Sciweavers

2654 search results - page 97 / 531
» On Pairing Inversion Problems
Sort
View
182
Voted
LPAR
1999
Springer
15 years 9 months ago
Practical Reasoning for Expressive Description Logics
Abstract. Description Logics (DLs) are a family of knowledge representation formalisms mainly characterised by constructors to build complex concepts and roles from atomic ones. Ex...
Ian Horrocks, Ulrike Sattler, Stephan Tobies
146
Voted
ISMB
1994
15 years 6 months ago
Kinematic Manipulation of Molecular Chains Subject to Rigid Constraint
Wepresent algorithms for kinematic manipulation of molecular chains subject to fixed bond lengths and bond angles. They are useful for calculating conformations of a molecule subj...
Dinesh Manocha, Yunshan Zhu
166
Voted
RTAS
2011
IEEE
14 years 7 months ago
Resource Sharing in GPU-Accelerated Windowing Systems
Recent windowing systems allow graphics applications to directly access the graphics processing unit (GPU) for fast rendering. However, application tasks that render frames on the...
Shinpei Kato, Karthik Lakshmanan, Yutaka Ishikawa,...
SWAT
2004
Springer
171views Algorithms» more  SWAT 2004»
15 years 10 months ago
Connectivity of Graphs Under Edge Flips
We study the following problem: Given a set V of n vertices and a set E of m edge pairs, we define a graph family G(V, E) as the set of graphs that have vertex set V and contain ...
Norbert Zeh
ACNS
2008
Springer
94views Cryptology» more  ACNS 2008»
15 years 6 months ago
An Authentication Scheme Based on the Twisted Conjugacy Problem
The conjugacy search problem in a group G is the problem of recovering an x G from given g G and h = x-1 gx. The alleged computational hardness of this problem in some groups was...
Vladimir Shpilrain, Alexander Ushakov