1169 search results - page 90 / 234 » Degrees of monotone complexity |
IJFCS
2008
15 years 24 days ago
2008
We present GLinClosure, a graded extension of the well-known LinClosure algorithm. GLinClosure can be used to compute degrees of semantic entailment from sets of fuzzy attribute i...
98
Voted
JSAC
2006
15 years 23 days ago
2006
We propose a simple pulse-amplitude modulation (PAM)-based coded modulation scheme that overcomes two major constraints of power line channels, viz., severe insertion-loss and impu...
110
click to vote
TCS
2008
15 years 21 days ago
2008
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
JSC
2007
15 years 21 days ago
2007
We present a new algorithm for the computation of resultants associated with multihomogeneous (and, in particular, homogeneous) polynomial equation systems using straight-line pro...
100
click to vote
IJCGA
2002
15 years 17 days ago
2002
This paper presents how the space of spheres and shelling may be used to delete a point from a d-dimensional triangulation efficiently. In dimension two, if k is the degree of the...