2957 search results - page 466 / 592 » The Complexity of Polynomial-Time Approximation |
PAMI
2010
13 years 7 months ago
2010
In this paper, we address the tasks of detecting, segmenting, parsing, and matching deformable objects. We use a novel probabilistic object model that we call a hierarchical defor...
TCOM
2010
13 years 7 months ago
2010
—Receive antenna selection for unitary space-time modulation (USTM) over semi-correlated Ricean fading channels is analyzed (this work generalizes that of Ma and Tepedelenlio˘gl...
SSDBM
2010
IEEE
13 years 7 months ago
2010
IEEE
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
CGO
2011
IEEE
13 years 26 days ago
2011
IEEE
—Approximating ideal program outputs is a common technique for solving computationally difficult problems, for adhering to processing or timing constraints, and for performance ...
ALGORITHMICA
2011
13 years 21 days ago
2011
Algorithms for determining quality/cost/price tradeoffs in saturated markets are consid-3 ered. A product is modeled by d real-valued qualities whose sum determines the unit cost ...