Sciweavers

2253 search results - page 84 / 451
» Computing with Realizational Morphology
Sort
View
CRYPTO
2005
Springer
116views Cryptology» more  CRYPTO 2005»
15 years 10 months ago
New Monotones and Lower Bounds in Unconditional Two-Party Computation
Since bit and string oblivious transfer and commitment, two primitives of paramount importance in secure two- and multi-party computation, cannot be realized in an unconditionally ...
Stefan Wolf, Jürg Wullschleger
DGCI
2005
Springer
15 years 10 months ago
Computation of Homology Groups and Generators
Topological invariants are extremely useful in many applications related to digital imaging and geometric modeling, and homology is a classical one, which has not yet been fully e...
Samuel Peltier, Sylvie Alayrangues, Laurent Fuchs,...
WEA
2009
Springer
165views Algorithms» more  WEA 2009»
15 years 9 months ago
On Computational Models for Flash Memory Devices
Flash memory-based solid-state disks are fast becoming the dominant form of end-user storage devices, partly even replacing the traditional hard-disks. Existing two-level memory hi...
Deepak Ajwani, Andreas Beckmann, Riko Jacob, Ulric...
TVCG
2010
162views more  TVCG 2010»
15 years 2 months ago
Computing Robustness and Persistence for Images
—We are interested in 3-dimensional images given as arrays of voxels with intensity values. Extending these values to a continuous function, we study the robustness of homology c...
Paul Bendich, Herbert Edelsbrunner, Michael Kerber
ISIM
2007
15 years 5 months ago
Formal Computation Independent Model of the Problem Domain within the MDA
The proposed approach called Topological Functioning Modeling for Model Driven Architecture (TFMfMDA) uses formal mathematical foundations of Topological Functioning Model. It intr...
Janis Osis, Erika Asnina, Andrejs Grave