Sciweavers

2693 search results - page 60 / 539
» On Computing Complex Navigation Functions
Sort
View
CSR
2009
Springer
14 years 4 months ago
A Feebly Secure Trapdoor Function
Abstract. In 1992, A. Hiltgen [1] provided the first constructions of provably (slightly) secure cryptographic primitives, namely feebly one-way functions. These functions are pro...
Edward A. Hirsch, Sergey I. Nikolenko
IMR
2003
Springer
14 years 3 months ago
Meshing Complexity of Single Part CAD Models
This paper proposes a method for predicting the complexity of meshing Computer Aided Design (CAD) geometries with unstructured, hexahedral, finite elements. Meshing complexity ref...
David R. White, Sunil Saigal, Steven J. Owen
DSN
2007
IEEE
14 years 4 months ago
Computing Battery Lifetime Distributions
The usage of mobile devices like cell phones, navigation systems, or laptop computers, is limited by the lifetime of the included batteries. This lifetime depends naturally on the...
Lucia Cloth, Marijn R. Jongerden, Boudewijn R. Hav...
CN
2010
109views more  CN 2010»
13 years 10 months ago
A taxonomy of biologically inspired research in computer networking
The natural world is enormous, dynamic, incredibly diverse, and highly complex. Despite the inherent challenges of surviving in such a world, biological organisms evolve, self-org...
Michael Meisel, Vasileios Pappas, Lixia Zhang
STACS
2007
Springer
14 years 4 months ago
Symmetries and the Complexity of Pure Nash Equilibrium
Strategic games may exhibit symmetries in a variety of ways. A characteristic feature, enabling the compact representation of games even when the number of players is unbounded, i...
Felix Brandt, Felix A. Fischer, Markus Holzer