Sciweavers

1274 search results - page 105 / 255
» Graph lambda theories
Sort
View
IACR
2011
130views more  IACR 2011»
12 years 8 months ago
Hiding the Policy in Cryptographic Access Control
Abstract. Recently, cryptographic access control has received a lot of attention, mainly due to the availability of efficient Attribute-Based Encryption (ABE) schemes. ABE allows ...
Sascha Müller, Stefan Katzenbeisser
ACSD
2007
IEEE
103views Hardware» more  ACSD 2007»
14 years 3 months ago
Output-Determinacy and Asynchronous Circuit Synthesis
Signal Transition Graphs (STG) are a formalism for the description of asynchronous circuit behaviour. In this paper we propose (and justify) a formal semantics of nondeterministic...
Victor Khomenko, Mark Schäfer, Walter Vogler
COMPGEOM
2003
ACM
14 years 2 months ago
Finding a curve in a map
Given a polygonal curve and a geometric graph, we describe an efficient algorithm to find a path in the graph which is most similar to the curve, using the well-known Fr´echet d...
Carola Wenk, Helmut Alt, Alon Efrat, Lingeshwaran ...
GIS
2009
ACM
14 years 23 days ago
A new perspective on efficient and dependable vehicle routing
The essential elements of any navigation system are a shortest-path algorithm and accurate map data. The contribution of this work is two-fold. First, the HBA algorithm, an effici...
Dieter Pfoser, Alexandros Efentakis, Agnès ...
JGT
2007
54views more  JGT 2007»
13 years 9 months ago
Overlap in consistent cycles
: A (directed) cycle C in a graph is called consistent provided there exists an automorphism of , acting as a 1-step rotation of C. A beautiful but not well-known result of J.H. Co...
Stefko Miklavic, Primoz Potocnik, Steve Wilson