Sciweavers

4037 search results - page 367 / 808
» Routing without ordering
Sort
View
IJCGA
2007
76views more  IJCGA 2007»
15 years 3 months ago
Immobilizing Hinged Polygons
: We study the problem of fixturing a chain of hinged objects in a given placement with frictionless point contacts. We define the notions of immobility and robust immobility, wh...
Jae-Sook Cheong, A. Frank van der Stappen, Kenneth...
134
Voted
TCS
2008
15 years 3 months ago
New constructions for provably-secure time-bound hierarchical key assignment schemes
A time-bound hierarchical key assignment scheme is a method to assign time-dependent encryption keys to a set of classes in a partially ordered hierarchy, in such a way that each ...
Alfredo De Santis, Anna Lisa Ferrara, Barbara Masu...
ENTCS
2002
103views more  ENTCS 2002»
15 years 3 months ago
Translation from timed Petri nets with intervals on transitions to intervals on places (with urgency)
Petri nets where, to my knowledge, the first theoretical model augmented with time constraints [Mer74], and the support of the first reachability algorithm of timed system [BM83, ...
Marc Boyer
133
Voted
JDM
1998
101views more  JDM 1998»
15 years 3 months ago
Fault-Tolerant Quorum Consensus Scheme for Replication Control in Mobile Distributed Database Systems
We propose a new replication control scheme for multiple-copy consistency in mobile distributed database systems. Replicating data at multiple sites could contribute to enhance th...
Siwoo Byun, Songchun Moon
134
Voted
CGF
2008
120views more  CGF 2008»
15 years 3 months ago
Online Personalised Non-photorealistic Rendering Technique for 3D Geometry from Incremental Sketching
This paper presents an online personalised non-photorealistic rendering (NPR) technique for 3D models generated from interactively sketched input. This technique has been integrat...
Daychyi Ku, Sheng Feng Qin, David K. Wright, CuiXi...