Sciweavers

1258 search results - page 117 / 252
» Architecture-driven Problem Decomposition
Sort
View
CSMR
2004
IEEE
14 years 24 days ago
Architecture-Aware Adaptive Clustering of OO Systems
The recovery of software architecture is a first important step towards re-engineering a software system. Architecture recovery usually involves clustering. The problem with curre...
Markus Bauer, Mircea Trifu
PODC
2010
ACM
13 years 11 months ago
Brief announcement: efficient graph algorithms without synchronization
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...
Johannes Schneider, Roger Wattenhofer
ICML
2010
IEEE
13 years 10 months ago
Bayesian Nonparametric Matrix Factorization for Recorded Music
Recent research in machine learning has focused on breaking audio spectrograms into separate sources of sound using latent variable decompositions. These methods require that the ...
Matthew D. Hoffman, David M. Blei, Perry R. Cook
ICASSP
2010
IEEE
13 years 9 months ago
Simultaneous search for all modes in multilinear models
Parallel factor (PARAFAC) analysis is an extension of a low rank decomposition to higher way arrays, usually called tensors. Most of existing methods are based on an alternating l...
Petr Tichavský, Zbynek Koldovský
CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 9 months ago
Privacy-Preserving Protocols for Eigenvector Computation
Abstract. In this paper, we present a protocol for computing the principal eigenvector of a collection of data matrices belonging to multiple semi-honest parties with privacy const...
Manas A. Pathak, Bhiksha Raj