2254 search results - page 289 / 451 » Computing the minimal covering set |
174
click to vote
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice problems in the worst case within a factor almost line...
200
click to vote
TMI
2010
15 years 1 months ago
2010
As decisions in cardiology increasingly rely on non-invasive methods, fast and precise image processing tools have become a crucial component of the analysis workflow. To the best ...
237
click to vote
ICCV
2009
IEEE
16 years 10 months ago
2009
IEEE
Many applications in computer vision require comparisons
between two images of the same scene. Comparison
applications usually assume that corresponding regions in
the two image...
136
Voted
CVPR
2000
IEEE
16 years 8 months ago
2000
IEEE
An algorithm is given for computing projective structure from a set of six points seen in a sequence of many images. The method is based on the notion of duality between cameras a...
142
click to vote
UC
2009
Springer
16 years 24 days ago
2009
Springer
Abstract. An amoeboid organism, Physarum, exhibits rich spatiotemporal oscillatory behavior and various computational capabilities. Previously, the authors created a recurrent neur...