4047 search results - page 214 / 810 » The Discrete Basis Problem |
121
Voted
MSWIM
2005
ACM
15 years 9 months ago
2005
ACM
This paper addresses a novel linear programming based approach to optimize the choice of the encoding parameters for the MPEG-4 AAC audio codec. Current techniques solve the encod...
105
click to vote
DM
2008
15 years 3 months ago
2008
We consider the problems of finding the maximum number of vertex-disjoint triangles (VTP) and edge-disjoint triangles (ETP) in a simple graph. Both problems are NP-hard. The algor...
107
Voted
FCT
2003
Springer
15 years 8 months ago
2003
Springer
: Proving integrality gaps for linear relaxations of NP optimization problems is a difficult task and usually undertaken on a case-by-case basis. We initiate a more systematic app...
144
click to vote
SIAMCO
2002
15 years 3 months ago
2002
As shown in [7], optimal control problems with either ODE or PDE dynamics can be solved efficiently using a setting of consistent approximations obtained by numerical discretizati...
113
Voted
ICPR
2000
IEEE
16 years 4 months ago
2000
IEEE
Motion segmentation using feature correspondences can be regarded as a combinatorial problem. A motion segmentation algorithm using feature selection and subspace method is propos...