8496 search results - page 432 / 1700 » Problem Solving and Complex Systems |
200
click to vote
ICCV
2007
IEEE
16 years 8 months ago
2007
IEEE
3D object reconstruction from a single 2D line drawing is an important problem in both computer vision and graphics. Many methods have been put forward to solve this problem, but ...
189
click to vote
FCT
2003
Springer
16 years 2 days ago
2003
Springer
Abstract. The NP-complete Distinguishing Substring Selection problem (DSSS for short) asks, given a set of “good” strings and a set of “bad” strings, for a solution string ...
155
click to vote
ITNG
2007
IEEE
16 years 1 months ago
2007
IEEE
Lots of efforts in the last decades have been done to prove or disprove whether the set of polynomially bounded problems is equal to the set of polynomially verifiable problems. T...
182
click to vote
ICIP
2009
IEEE
16 years 8 months ago
2009
IEEE
A multiplier-less low complexity reversible integer Karhunen-Lo?ve transform (Low-RKLT) is proposed based on multi-lifting. Conventional methods based on KLT suffer from high comp...
158
click to vote
DCC
2004
IEEE
16 years 6 months ago
2004
IEEE
A steepest descent based bit allocation method with polynomial iteration complexity for minimizing the sum of frame distortions under a total bit rate constraint is presented for ...