2127 search results - page 70 / 426 » Computing large matchings fast |
135
click to vote
VLSID
2008
IEEE
16 years 4 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...
125
Voted
ICPR
2006
IEEE
16 years 4 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...
118
Voted
KDD
2004
ACM
16 years 4 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...
147
Voted
ISCSCT
2008
IEEE
15 years 10 months 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...
136
Voted
IBPRIA
2009
Springer
15 years 8 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...