Sciweavers

30 search results - page 1 / 6
» ATV: An Efficient Method for Constructing a Certification Pa...
Sort
View
73
Voted
IFIP
2004
Springer
15 years 3 months ago
ATV: An Efficient Method for Constructing a Certification Path
: Constructing a certification path is the mainly method of validating a certificate at given time. The established path will consist of all the valid certificates that reside betw...
Omar Batarfi
78
Voted
ACISP
2006
Springer
15 years 2 months ago
Efficient Identity-Based Signatures Secure in the Standard Model
The only known construction of identity-based signatures that can be proven secure in the standard model is based on the approach of attaching certificates to non-identity-based si...
Kenneth G. Paterson, Jacob C. N. Schuldt
92
Voted
FAW
2008
Springer
127views Algorithms» more  FAW 2008»
15 years 22 hour ago
Visiting a Polygon on the Optimal Way to a Query Point
Abstract. We study a constrained version of the shortest path problem in polygonal domains, in which the path must visit a given target polygon. We provide an efficient algorithm f...
Ramtin Khosravi, Mohammad Ghodsi
69
Voted
FOCM
2002
97views more  FOCM 2002»
14 years 10 months ago
On the Riemannian Geometry Defined by Self-Concordant Barriers and Interior-Point Methods
We consider the Riemannian geometry defined on a convex set by the Hessian of a selfconcordant barrier function, and its associated geodesic curves. These provide guidance for the...
Yu. E. Nesterov, Michael J. Todd
AMAI
2008
Springer
14 years 10 months ago
The giving tree: constructing trees for efficient offline and online multi-robot coverage
This paper discusses the problem of building efficient coverage paths for a team of robots. An efficient multi-robot coverage algorithm should result in a coverage path for every ...
Noa Agmon, Noam Hazon, Gal A. Kaminka