3608 search results - page 595 / 722 » computing 2011 |
272
click to vote
SDM
2011
SIAM
14 years 6 months ago
2011
SIAM
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
147
Voted
SIGMOD
2011
ACM
14 years 6 months ago
2011
ACM
In this paper we consider the problem of answering queries using views, which is important for data integration, query optimization, and data warehouses. We consider its simplest ...
190
Voted
3DIM
2011
IEEE
14 years 3 months ago
2011
IEEE
—Keypoints on 3D surfaces are points that can be extracted repeatably over a wide range of 3D imaging conditions. They are used in many 3D shape processing applications; for exam...
228
click to vote
3DIM
2011
IEEE
14 years 3 months ago
2011
IEEE
Addressing the image correspondence problem by feature matching is a central part of computer vision and 3D inference from images. Consequently, there is a substantial amount of w...
132
Voted
AAAI
2011
14 years 3 months ago
2011
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...