1859 search results - page 298 / 372 » Using Problems to Learn Service-Oriented Computing |
149
click to vote
ECCV
2006
Springer
16 years 6 months ago
2006
Springer
Abstract. We formulate a robust method using Expectation Maximization (EM) to address the problem of dense photometric stereo. Previous approaches using Markov Random Fields (MRF) ...
148
Voted
ENTCS
2007
15 years 4 months ago
2007
In the domain of software engineering, the use of software components is now a well established approach. However, it raises problems about the dynamic adaptation of these compone...
156
click to vote
NIPS
2004
15 years 6 months ago
2004
We propose a new method for clustering based on finding maximum margin hyperplanes through data. By reformulating the problem in terms of the implied equivalence relation matrix, ...
157
click to vote
PAMI
2010
15 years 3 months ago
2010
—A new formulation for multiway spectral clustering is proposed. This method corresponds to a weighted kernel principal component analysis (PCA) approach based on primal-dual lea...
151
click to vote
STOC
2004
ACM
16 years 5 months ago
2004
ACM
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...