895 search results - page 137 / 179 » Approximate convex decomposition |
86
Voted
ESA
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
DASFAA
2003
IEEE
15 years 3 months ago
2003
IEEE
Modern database applications including computeraided design (CAD), medical imaging, or molecular biology impose new requirements on spatial query processing. Particular problems a...
SIAMMAX
2010
14 years 4 months ago
2010
It is well-known that two-level and multi-level preconditioned conjugate gradient (PCG) methods provide efficient techniques for solving large and sparse linear systems whose coeff...
110
click to vote
KDD
2012
ACM
13 years 4 days ago
2012
ACM
Non-negative matrix factorization (NMF) provides a lower rank approximation of a matrix. Due to nonnegativity imposed on the factors, it gives a latent structure that is often mor...
105
click to vote
KDD
2008
ACM
15 years 10 months ago
2008
ACM
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...