Sciweavers

838 search results - page 127 / 168
» Finding Optimal Solutions to Atomix
Sort
View
JGAA
2000
179views more  JGAA 2000»
15 years 5 months ago
Approximation Algorithms for Some Graph Partitioning Problems
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...
George He, Jiping Liu, Cheng Zhao
MOC
2000
83views more  MOC 2000»
15 years 5 months ago
Stability and B-convergence properties of multistep Runge-Kutta methods
This paper continues earlier work by the same author concerning the stability and B-convergence properties of multistep Runge-Kutta methods for the numerical solution of nonlinear ...
Shoufu Li
NECO
2000
86views more  NECO 2000»
15 years 5 months ago
A Bayesian Committee Machine
The Bayesian committee machine (BCM) is a novel approach to combining estimators which were trained on different data sets. Although the BCM can be applied to the combination of a...
Volker Tresp
BMVC
2010
15 years 3 months ago
Stratified Generalized Procrustes Analysis
This paper deals with generalized procrustes analysis. This is the problem of registering a set of shape data by finding a reference shape and global rigid transformations given p...
Adrien Bartoli, Daniel Pizarro, Marco Loog
ICDM
2010
IEEE
135views Data Mining» more  ICDM 2010»
15 years 3 months ago
Learning a Bi-Stochastic Data Similarity Matrix
An idealized clustering algorithm seeks to learn a cluster-adjacency matrix such that, if two data points belong to the same cluster, the corresponding entry would be 1; otherwise ...
Fei Wang, Ping Li, Arnd Christian König