16430 search results - page 353 / 3286 » On Computable Tree Functions |
128
click to vote
ICPR
2000
IEEE
16 years 6 months ago
2000
IEEE
The matching of hierarchical relational structures is of significant interest in computer vision and pattern recognition. We have recently introduced a new solution to this proble...
148
click to vote
ICML
2004
IEEE
16 years 5 months ago
2004
IEEE
Computer experiments often require dense sweeps over input parameters to obtain a qualitative understanding of their response. Such sweeps can be prohibitively expensive, and are ...
147
click to vote
CVPR
2010
IEEE
16 years 1 months ago
2010
IEEE
We propose an approach to speeding up object detection, with an emphasis on settings where multiple object classes are being detected. Our method uses a segmentation algorithm to ...
143
click to vote
IPPS
2007
IEEE
15 years 11 months ago
2007
IEEE
Although algorithms that employ dynamic reconfiguration are extremely fast, they need the underlying architecture to change structure very rapidly, possibly at each step of the c...
144
click to vote
TCOM
2010
15 years 3 months ago
2010
Abstract—In this letter, we propose an extension of the probabilistic tree pruning sphere decoding (PTP-SD) algorithm that provides further improvement of the computational compl...