Sciweavers

13603 search results - page 104 / 2721
» On the Complexity of Computing Treelength
Sort
View
SCN
2010
Springer
129views Communications» more  SCN 2010»
13 years 7 months ago
Improved Primitives for Secure Multiparty Integer Computation
We consider a collection of related multiparty computation protocols that provide core operations for secure integer and fixed-point computation. The higher-level protocols offer...
Octavian Catrina, Sebastiaan de Hoogh
ISB
2002
140views more  ISB 2002»
13 years 9 months ago
Computer system "Gene Discovery" for promoter structure analysis
Data Mining and Knowledge Discovery techniques proved to be efficient tools for variety of complex tasks in biology including DNA research. This paper presents implementation of th...
Eugenii E. Vityaev, Yuri L. Orlov, Oleg V. Vishnev...
COMGEO
2010
ACM
13 years 7 months ago
Computing the visibility map of fat objects
Abstract. We give an output-sensitive algorithm for computing the visibility map of a set of n constant-complexity convex fat polyhedra or curved objects in 3-space. Our algorithm ...
Mark de Berg, Chris Gray
MOC
1998
88views more  MOC 1998»
13 years 9 months ago
A space efficient algorithm for group structure computation
We present a new algorithm for computing the structure of a finite abelian group, which has to store only a fixed, small number of group elements, independent of the group order....
Edlyn Teske
DCG
2010
97views more  DCG 2010»
13 years 7 months ago
Cech Type Approach to Computing Homology of Maps
A new approach to algorithmic computation of the homology of spaces and maps is presented. The key point of the approach is a change in the representation of sets. The proposed rep...
Marian Mrozek