2600 search results - page 70 / 520 » Clustering with or without the Approximation |
113
click to vote
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
Several ways of using singular value decomposition (SVD), a linear algebra technique typically used for information retrieval, to decompose problems into subproblems are investiga...
JMLR
2010
14 years 4 months ago
2010
Many structured information extraction tasks employ collective graphical models that capture interinstance associativity by coupling them with various clique potentials. We propos...
KR
2000
Springer
15 years 1 months ago
2000
Springer
In contrast with classical reasoning, where a solution is either correct or incorrect, approximate reasoning tries to compute solutions which are close to the ideal solution, with...
AAAI
2006
14 years 11 months ago
2006
We show in this paper that the influential algorithm of iterative belief propagation can be understood in terms of exact inference on a polytree, which results from deleting enoug...
MOC
2002
14 years 9 months ago
2002
We consider finite element operators defined on "rough" functions in a bounded polyhedron in RN . Insisting on preserving positivity in the approximations, we discover a...