We present an algorithm to compute the Weierstrass semigroup at a point P together with functions for each value in the semigroup, provided P is the only branch at infinity of a singular plane model for the curve. As a byproduct, the method also provides us with a basis for the spaces L(mP ) and the computation of the Feng-Rao distance for the corresponding array of geometric Goppa codes. A gen...

Leighton and Rao use multicommodity flow results to design the first polynomial time approximation algorithms for well known NP-Hard optimization problems. Such problems include graph partitioning, crossing number, VLSI layout, and many more. Furthermore, Leighton and Rao are responsible for establishing the max-flow min-cut theorems on multicommodity flow problems, which lead to the algorithms...

-In this paper we present new approximation expressions for the Cramer-Rao Lower Bound on unbiased estimates of frequency, phase, amplitude and DC offset for uniformly sampled signal embedded in white-Gaussian noise. This derivation is based on well-known assumptions and a novel set of approximations for finite series of trigonometric functions. The estimated Cramer-Rao Lower Bounds are given i...