Sciweavers

13621 search results - page 375 / 2725
» Computability and Complexity in Self-assembly
Sort
View
JSC
2007
106views more  JSC 2007»
15 years 6 months ago
Computing multihomogeneous resultants using straight-line programs
We present a new algorithm for the computation of resultants associated with multihomogeneous (and, in particular, homogeneous) polynomial equation systems using straight-line pro...
Gabriela Jeronimo, Juan Sabia
MOC
1998
88views more  MOC 1998»
15 years 6 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»
15 years 5 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
NA
2010
144views more  NA 2010»
15 years 5 months ago
A binary powering Schur algorithm for computing primary matrix roots
An algorithm for computing primary roots of a nonsingular matrix A is presented. In particular, it computes the principal root of a real matrix having no nonpositive real eigenvalu...
Federico Greco, Bruno Iannazzo
ANSS
2006
IEEE
16 years 27 days ago
A New Approach for Computing Conditional Probabilities of General Stochastic Processes
In this paper Hidden Markov Model algorithms are considered as a method for computing conditional properties of continuous-time stochastic simulation models. The goal is to develo...
Fabian Wickborn, Claudia Isensee, Thomas Simon, Sa...