4047 search results - page 32 / 810 » The Discrete Basis Problem |
128
click to vote
NIPS
2008
15 years 6 months ago
2008
We introduce a novel framework for estimating vector fields using sparse basis field expansions (S-FLEX). The notion of basis fields, which are an extension of scalar basis functi...
164
Voted
STACS
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We consider the problem of computing a minimum cycle basis in a directed graph G with m arcs and n vertices. The arcs of G have non-negative weights assigned to them. We ...
161
click to vote
CP
1999
Springer
15 years 9 months ago
1999
Springer
In this paper we present a Lagrange-multiplier formulation of discrete constrained optimization problems, the associated discrete-space first-order necessary and sufficient condit...
194
click to vote
JMLR
2012
13 years 7 months ago
2012
In this paper, we propose a novel formulation of the network clique detection problem by introducing a general network data representation framework. We show connections between o...
143
Voted
SIAMCOMP
2008
15 years 4 months ago
2008
Helly's theorem says that, if every d+1 elements of a given finite set of convex objects in Rd have a common point, there is a point common to all of the objects in the set. I...