We propose blind equalization algorithms that perform similarly to supervised ones, independently of the QAM order. They converge approximately to the Wiener solution, which gener...
Joao Mendes Filho, Magno T. M. Silva, Maria D. Mir...
We present subexponential parameterized algorithms on planar graphs for a family of problems of the following shape: given a graph, find a connected (induced) subgraph with bounde...
Generalization is a fundamental operation of inductive inference. While rst order syntactic generalization anti-uni cation is well understood, its various extensions are needed in...
Graph pyramids are often used for representing irregular image pyramids. For the 2D case, combinatorial pyramids have been recently defined in order to explicitly represent more ...
Abstract. We present a unified and complete account of maximum entropy distribution estimation subject to constraints represented by convex potential functions or, alternatively, b...