301 search results - page 49 / 61 » On Finding Dense Subgraphs |
IEEEPACT
1999
IEEE
15 years 1 months ago
1999
IEEE
Image processing applications tend to access their data non-sequentially and reuse that data infrequently. As a result, they tend to perform poorly on conventional memory systems ...
3DPVT
2004
IEEE
15 years 1 months ago
2004
IEEE
We examine the implications of shape on the process of finding dense correspondence and half-occlusions for a stereo pair of images. The desired property of the depth map is that ...
CVRMED
1995
Springer
15 years 1 months ago
1995
Springer
Abstract. Some medical interventions require knowing the correspondence between an MRI/CT image and the actual position of the patient. Examples are in neurosurgery or radiotherapy...
125
click to vote
BMVC
2002
15 years 1 days ago
2002
This paper approaches the problem of finding correspondences between images in which there are large changes in viewpoint, scale and illumination. Recent work has shown that scale...
ARC
2008
Springer
14 years 11 months ago
2008
Springer
As Field Programmable Gate Arrays (FPGAs) have reached capacities beyond millions of equivalent gates, it becomes possible to accelerate floating-point scientific computing applica...