12519 search results - page 405 / 2504 » Approximation Problems Categories |
147
click to vote
WALCOM
2010
IEEE
16 years 1 months ago
2010
IEEE
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain ...
168
click to vote
ASIAMS
2008
IEEE
16 years 1 months ago
2008
IEEE
The multiobjective Quadratic Assignment Problem (mQAP) is considered as one of the hardest optimization problems but with many real-world applications. Since it may not be possibl...
219
Voted
ICCS
2007
Springer
16 years 29 days ago
2007
Springer
Assimilation of spatially- and temporally-distributed state observations into simulations of dynamical systems stemming from discretized PDEs leads to inverse problems with high-di...
181
click to vote
SSDBM
2003
IEEE
16 years 2 days ago
2003
IEEE
Space constrained optimization problems arise in a multitude of important applications such as data warehouses and pervasive computing. A typical instance of such problems is to s...
175
click to vote
ECCV
2006
Springer
15 years 10 months ago
2006
Springer
The formulation of trace quotient is shared by many computer vision problems; however, it was conventionally approximated by an essentially different formulation of quotient trace,...