Sciweavers

15073 search results - page 194 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
ICCNMC
2005
Springer
15 years 9 months ago
Least Cost Multicast Spanning Tree Algorithm for Local Computer Network
This study deals with the topology discovery for the capacitated minimum spanning tree network. The problem is composed of finding the best way to link nodes to a source node and, ...
Yong-Jin Lee, Mohammed Atiquzzaman
ISSAC
1997
Springer
125views Mathematics» more  ISSAC 1997»
15 years 8 months ago
A Modular Algorithm for Computing Greatest Common Right Divisors of Ore Polynomials
Abstract. This paper presents a modular algorithm for computing the greatest common right divisor (gcrd) of two univariate Ore polynomials over Z[t]. The subresultants of Ore polyn...
Ziming Li, István Nemes
COMGEO
2006
ACM
15 years 4 months ago
A new algorithmic approach to the computation of Minkowski functionals of polyconvex sets
An algorithm is proposed for the simultaneous computation of all Minkowski functionals (except for the volume) of sets from the convex ring in Rd discretized with respect to a give...
Simone Klenk, Volker Schmidt, Evgueni Spodarev
EXPCS
2007
15 years 7 months ago
EXACT: the experimental algorithmics computational toolkit
In this paper, we introduce EXACT, the EXperimental Algorithmics Computational Toolkit. EXACT is a software framework for describing, controlling, and analyzing computer experimen...
William E. Hart, Jonathan W. Berry, Robert T. Heap...
ICIAP
2005
ACM
15 years 9 months ago
Markovian Energy-Based Computer Vision Algorithms on Graphics Hardware
This paper shows how Markovian segmentation algorithms used to solve well known computer vision problems such as motion estimation, motion detection and stereovision can be signiï¬...
Pierre-Marc Jodoin, Max Mignotte, Jean-Franç...