Sciweavers

26354 search results - page 376 / 5271
» How we refactor, and how we know it
Sort
View
TCC
2004
Springer
134views Cryptology» more  TCC 2004»
16 years 7 days ago
A Universally Composable Mix-Net
We show how to public-key obfuscate two commonly used shuffles: decryption shuffles which permute and decrypt ciphertexts, and re-encryption shuffles which permute and re-encrypt c...
Douglas Wikström
WISE
2002
Springer
15 years 11 months ago
Towards Declarative XML Querying
How to extract data from XML documents is an important issue for XML research and development. However, how to view XML documents determines how they can be queried. In this paper...
Mengchi Liu, Tok Wang Ling
WSC
2008
15 years 9 months ago
Incorporating information networks into military simulations
Information superiority is considered a critical capability for future joint forces. As advances in technology continue to boost our ability to communicate in new and different wa...
Darryl K. Ahner, Jonathon K. Alt, Francisco Baez, ...
IJCV
2007
115views more  IJCV 2007»
15 years 6 months ago
Discovering Shape Classes using Tree Edit-Distance and Pairwise Clustering
This paper describes work aimed at the unsupervised learning of shape-classes from shock trees. We commence by considering how to compute the edit distance between weighted trees. ...
Andrea Torsello, Antonio Robles-Kelly, Edwin R. Ha...
VIROLOGY
2008
84views more  VIROLOGY 2008»
15 years 6 months ago
Formal affordance-based models of computer virus reproduction
We present a novel classification of computer viruses using a formalised notion of reproductive models based on Gibson's theory of affordances. A computer virus reproduction ...
Matt Webster, Grant Malcolm