2127 search results - page 70 / 426 » Computing large matchings fast |
170
click to vote
VLSID
2008
IEEE
16 years 6 months ago
2008
IEEE
In the automatic design of custom instruction set processors, there can be a very large set of potential custom instructions, from which a few instructions are required to be chos...
162
click to vote
ICPR
2006
IEEE
16 years 7 months ago
2006
IEEE
We propose a variational multigrid method for fast 3D interpretation of image sequences, in which a dense depth map and 3D motion are directly recovered from spatiotemporal change...
152
click to vote
KDD
2004
ACM
16 years 6 months ago
2004
ACM
We define a connection subgraph as a small subgraph of a large graph that best captures the relationship between two nodes. The primary motivation for this work is to provide a pa...
194
click to vote
ISCSCT
2008
IEEE
16 years 21 days ago
2008
IEEE
—In this paper, we present a novel method to reconstruct the large scale scenes from multiple calibrated images. It first generates a quasi-dense 3D point cloud of the scene by m...
174
click to vote
IBPRIA
2009
Springer
15 years 11 months ago
2009
Springer
ent abstract presents OASIS, an Online Algorithm for Scalable Image Similarity learning that learns a bilinear similarity measure over sparse representations. OASIS is an online du...