Sciweavers

1548 search results - page 183 / 310
» Computational Approaches to Sentence Completion
Sort
View
NDSS
1998
IEEE
14 years 1 months ago
Efficient Protocols for Signing Routing Messages
In this work, we aim to reduce the computational costs of using public-key digital signatures in securing routing protocols. Two protocols (COSP and IOSP) using one-time digitalsi...
Kan Zhang
CPE
1994
Springer
170views Hardware» more  CPE 1994»
14 years 1 months ago
Automatic Scalability Analysis of Parallel Programs Based on Modeling Techniques
When implementingparallel programs forparallel computer systems the performancescalability of these programs should be tested and analyzed on different computer configurations and...
Allen D. Malony, Vassilis Mertsiotakis, Andreas Qu...
SMA
1995
ACM
190views Solid Modeling» more  SMA 1995»
14 years 13 days ago
Creating solid models from single 2D sketches
We describe a method of constructing a B-rep solid model from a single hidden-line removed sketch view of a 3D object. The main steps of our approach are as follows. The sketch is...
Ian J. Grimstead, Ralph R. Martin
CG
2005
Springer
13 years 8 months ago
Recognition and beautification of multi-stroke symbols in digital ink
Sketch-based user interfaces provide a more direct and convenient way for interacting with computers, especially for performing graphical tasks. Most computer programs provide a m...
Heloise Hwawen Hse, A. Richard Newton
CCS
2009
ACM
14 years 9 months ago
D-algebra for composing access control policy decisions
This paper proposes a D-algebra to compose decisions from multiple access control policies. Compared to other algebrabased approaches aimed at policy composition, D-algebra is the...
Qun Ni, Elisa Bertino, Jorge Lobo