2028 search results - page 102 / 406 » Deriving Relation Keys from XML Keys |
152
click to vote
CSFW
2012
IEEE
13 years 6 months ago
2012
IEEE
—Formal methods have proved their usefulness for analysing the security of protocols. In this setting, privacy-type security properties (e.g. vote-privacy, anonymity, unlinkabili...
180
click to vote
ESA
2007
Springer
15 years 10 months ago
2007
Springer
We present an experimental evaluation of an approximate distance oracle recently suggested by Thorup [1] for undirected planar graphs. The oracle uses the existence of graph separa...
120
click to vote
IFIP
2003
Springer
15 years 9 months ago
2003
Springer
Wi-Fi hotspots are one of the most promising scenarios for mobile computing. In this scenario, a very limiting factor is the scarcity of mobile-device energetic resources. Both har...
119
click to vote
TCS
2008
15 years 4 months ago
2008
Density elimination, a close relative of cut elimination, consists of removing applications of the Takeuti-Titani density rule from derivations in Gentzen-style (hypersequent) cal...
141
click to vote
EDBT
2008
ACM
16 years 4 months ago
2008
ACM
Retrieving related graphs containing a query graph from a large graph database is a key issue in many graph-based applications, such as drug discovery and structural pattern recog...