Sciweavers

310 search results - page 24 / 62
» Why Delannoy numbers
Sort
View
CSFW
2005
IEEE
14 years 3 months ago
Temporal Rank Functions for Forward Secrecy
A number of key establishment protocols claim the property of forward secrecy, where the compromise of a longterm key does not result in the compromise of previously computed sess...
Rob Delicata, Steve A. Schneider
SMI
2005
IEEE
109views Image Analysis» more  SMI 2005»
14 years 3 months ago
Practical Spherical Embedding of Manifold Triangle Meshes
Gotsman et al. (SIGGRAPH 2003) presented the first method to generate a provably bijective parameterization of a closed genus-0 manifold mesh to the unit sphere. This involves the...
Shadi Saba, Irad Yavneh, Craig Gotsman, Alla Sheff...
PDC
2004
ACM
14 years 3 months ago
Introducing participatory design in museums
This paper describes how a set of participatory design methodologies have been introduced to and adopted for museum exhibition design. It provides a brief historical account of mu...
Gustav Taxén
ANTSW
2004
Springer
14 years 3 months ago
Search Bias in Constructive Metaheuristics and Implications for Ant Colony Optimisation
Constructive metaheuristics explore a tree of constructive decisions, the topology of which is determined by the way solutions are represented and constructed. Some solution repres...
James Montgomery, Marcus Randall, Tim Hendtlass
APN
2004
Springer
14 years 3 months ago
Reachability Set Generation for Petri Nets: Can Brute Force Be Smart?
Generating the reachability set is one of the most commonly required step when analyzing the logical or stochastic behavior of a system modeled with Petri nets. Traditional “expl...
Gianfranco Ciardo