output
20022008
most citedClustered Multi-Task Learning: A Convex Formulation

285 citations

researchers with a paper here
collaborating institutions
Showing 2003Show all

5 papers · 1 filter

math.OC2003★ 32 cited

Reachability problems for products of matrices in semirings

Stephane Gaubert, Ricardo Katz

We consider the following matrix reachability problem: given square matrices with entries in a semiring, is there a product of these matrices which attains a prescribed matrix?…

math.CO2003★ 39 cited

Singularity analysis, Hadamard products, and tree recurrences

James Allen Fill, Philippe Flajolet, Nevin Kapur

We present a toolbox for extracting asymptotic information on the coefficients of combinatorial generating functions. This toolbox notably includes a treatment of the effect of Had…

math.AG2003★ 1 cited

Multihomogeneous resultant formulae by means of complexes

A. Dickenstein, I. Emiris

We provide conditions and algorithmic tools so as to classify and construct the smallest possible determinantal formulae for multihomogeneous resultants arising from Weyman complex…

math.CO2003

Domino tilings and related models: space of configurations of domains with holes

Sebastien Desreux, Martin Matamala, Ivan Rapaport +1

We first prove that the set of domino tilings of a fixed finite figure is a distributive lattice, even in the case when the figure has holes. We then give a geometrical interpretat…

math.AG2003

Implicitizing rational hypersurfaces using approximation complexes

Laurent Buse, Marc Chardin

In this paper we describe an algorithm for implicitizing rational hypersurfaces in case there exists at most a finite number of base points. It is based on a technique exposed in m…