165 search results - page 30 / 33 » Computing hereditary convex structures |
101
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
The group Lasso is an extension of the Lasso for feature selection on (predefined) non-overlapping groups of features. The non-overlapping group structure limits its applicability...
109
click to vote
CORR
2008
Springer
14 years 11 months ago
2008
Springer
A set of N independent Gaussian linear time invariant systems is observed by M sensors whose task is to provide the best possible steady-state causal minimum mean square estimate o...
103
Voted
DCG
2010
14 years 11 months ago
2010
The Voronoi diagram of a point set is a fundamental geometric structure that partitions the space into elementary regions of influence defining a discrete proximity graph and dual...
81
Voted
IJRR
2008
14 years 11 months ago
2008
: We present algorithms for computing all placements of two and three fingers that cage a given polygonal object with n edges in the plane. A polygon is caged when it is impossible...
77
Voted
MP
2008
14 years 11 months ago
2008
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...