140 search results - page 22 / 28 » Random projection algorithms for convex set intersection pro... |
108
click to vote
MP
2011
14 years 4 months ago
2011
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in machine learning, control theory, and discrete geometry. This c...
75
Voted
ICCAD
2004
IEEE
15 years 6 months ago
2004
IEEE
In this paper we propose a RObust Analog Design tool (ROAD) for post-tuning analog/RF circuits. Starting from an initial design derived from hand analysis or analog circuit synthe...
97
Voted
CVPR
2008
IEEE
15 years 11 months ago
2008
IEEE
We consider the problem of finding a matching between two sets of features, given complex relations among them, going beyond pairwise. Each feature set is modeled by a hypergraph ...
85
Voted
COMPGEOM
2003
ACM
15 years 2 months ago
2003
ACM
We develop algorithms for computing the smallest enclosing ball of a set of n balls in d-dimensional space. Unlike previous methods, we explicitly address small cases (n ≤ d + 1...
93
Voted
SIGECOM
2010
ACM
15 years 2 months ago
2010
ACM
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...