588 search results - page 74 / 118 » Computing the Dimension of Linear Subspaces |
COMGEO
2004
ACM
13 years 9 months ago
2004
ACM
We present a novel hierarchical force-directed method for drawing large graphs. Given a graph G = (V,E), the algorithm produces an embedding for G in an Euclidean space E of any d...
CPHYSICS
2010
13 years 10 months ago
2010
We investigate fully parallel Newton-Krylov-Schwarz (NKS) algorithms for solving the large sparse nonlinear systems of equations arising from the finite element discretization of ...
STOC
2007
ACM
14 years 10 months ago
2007
ACM
Compressed Sensing is a new paradigm for acquiring the compressible signals that arise in many applications. These signals can be approximated using an amount of information much ...
CVPR
2012
IEEE
12 years 10 days ago
2012
IEEE
Scale invariant feature detectors often find stable scales in only a few image pixels. Consequently, methods for feature matching typically choose one of two extreme options: mat...
ACCV
2007
Springer
14 years 1 months ago
2007
Springer
Normalized Cuts has successfully been applied to a wide range of tasks in computer vision, it is indisputably one of the most popular segmentation algorithms in use today. A number...