4047 search results - page 311 / 810 » The Discrete Basis Problem |
145
click to vote
SIAMSC
2008
15 years 4 months ago
2008
Abstract. In this paper, we empirically investigate the NP-hard problem of finding sparsest solutions to linear equation systems, i.e., solutions with as few nonzeros as possible. ...
150
click to vote
WWW
2005
ACM
16 years 5 months ago
2005
ACM
While many works have been devoted to service matchmaking and modeling nonfunctional properties, the problem of matching service requests to offers in an optimal way has not yet b...
138
Voted
CVPR
2010
IEEE
16 years 1 months ago
2010
IEEE
Many computer vision problems involving feature correspondence among images can be formulated as an assignment problem with a quadratic cost function. Such problems are computatio...
160
click to vote
STOC
2007
ACM
16 years 5 months ago
2007
ACM
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for KemenyYoung ran...
148
click to vote
SOFSEM
2009
Springer
16 years 1 months ago
2009
Springer
Petri nets are an effective formalism to model discrete event systems, and several variants have been defined to explicitly include real time in the model. We consider two fundam...