Sciweavers

1258 search results - page 66 / 252
» Architecture-driven Problem Decomposition
Sort
View
PC
2010
101views Management» more  PC 2010»
13 years 4 months ago
An efficient parallel implementation of the MSPAI preconditioner
We present an efficient implementation of the Modified SParse Approximate Inverse (MSPAI) preconditioner. MSPAI generalizes the class of preconditioners based on Frobenius norm mi...
Thomas Huckle, A. Kallischko, A. Roy, M. Sedlacek,...
ICML
2009
IEEE
14 years 10 months ago
On sampling-based approximate spectral decomposition
This paper addresses the problem of approximate singular value decomposition of large dense matrices that arises naturally in many machine learning applications. We discuss two re...
Sanjiv Kumar, Mehryar Mohri, Ameet Talwalkar
SCALESPACE
2009
Springer
14 years 3 months ago
Computational Geometry-Based Scale-Space and Modal Image Decomposition
In this paper a framework for defining scale-spaces, based on the computational geometry concepts of α-shapes, is proposed. In this approach, objects (curves or surfaces) of incr...
Anatole Chessel, Bertrand Cinquin, Sabine Bardin, ...
DSOM
2006
Springer
14 years 27 days ago
Towards Distributed Hash Tables (De)Composition in Ambient Networks
When different wireless networks come in close proximity there is often a need for them to logically combine, or compose. We focus on a known research problem particularly in Ambie...
Lawrence Cheng, Roel Ocampo, Kerry Jean, Alex Gali...
ISIM
2007
13 years 10 months ago
Using Matrix Decompositions in Formal Concept Analysis
One of the main problems connected with the formal concept analysis and lattice construction is the high complexity of algorithms which plays a significant role when computing all ...
Václav Snásel, Petr Gajdos, Hussam M...