10608 search results - page 164 / 2122 » Complexity of O'Hara's Algorithm |
ISSAC
2007
Springer
14 years 4 months ago
2007
Springer
In this paper, it is shown that the Hilbert series of a Borel type ideal may be computed within a complexity which is polynomial in Dn where n + 1 is the number of unknowns and D ...
MFCS
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. Problem parameters are ubiquitous. In every area of computer science, we find all kinds of “special aspects” to the problems encountered. Hence, the study of paramet...
CIMAGING
2010
13 years 10 months ago
2010
We present the implementation and evaluation of a penalized alternating minimization (AM) method1 for the computation of a specimen's complex transmittance function (magnitud...
HICSS
2002
IEEE
14 years 3 months ago
2002
IEEE
—Connected dominating set (CDS) has been proposed as virtual backbone or spine of wireless ad hoc networks. Three distributed approximation algorithms have been proposed in the l...
PKDD
2001
Springer
14 years 2 months ago
2001
Springer
This paper discusses the clustering quality and complexities of the hierarchical data clustering algorithm based on gravity theory. The gravitybased clustering algorithm simulates ...