Sciweavers

81 search results - page 6 / 17
» Properties of Random Triangulations and Trees
Sort
View
ESA
1999
Springer
95views Algorithms» more  ESA 1999»
14 years 2 months ago
A Fast General Methodology for Information - Theoretically Optimal Encodings of Graphs
We propose a fast methodology for encoding graphs with information-theoretically minimum numbers of bits. Specifically, a graph with property π is called a π-graph. If π satis...
Xin He, Ming-Yang Kao, Hsueh-I Lu
ORL
2010
85views more  ORL 2010»
13 years 8 months ago
Stable routing under the Spanning Tree Protocol
The Spanning Tree Protocol routes traffic on shortest path trees. If some edges fail, the traffic has to be rerouted consequently, setting up alternative trees. In this paper we d...
Fabrizio Grandoni, Gaia Nicosia, Gianpaolo Oriolo,...
EUROCRYPT
2010
Springer
14 years 2 months ago
Bonsai Trees, or How to Delegate a Lattice Basis
We introduce a new lattice-based cryptographic structure called a bonsai tree, and use it to resolve some important open problems in the area. Applications of bonsai trees include...
David Cash, Dennis Hofheinz, Eike Kiltz, Chris Pei...
CONCUR
2000
Springer
14 years 2 months ago
Verifying Quantitative Properties of Continuous Probabilistic Timed Automata
Abstract. We consider the problem of automatically verifying realtime systems with continuously distributed random delays. We generalise probabilistic timed automata introduced in ...
Marta Z. Kwiatkowska, Gethin Norman, Roberto Segal...
IJBRA
2010
108views more  IJBRA 2010»
13 years 7 months ago
Assessing and improving the accuracy of detecting protein adaptation with the TreeSAAP analytical software
The TreeSAAP software has been successfully used in a variety of protein studies for identifying and characterizing adaptation in terms of shifts in the physicochemical properties ...
David A. McClellan, David D. Ellison