Sciweavers

3096 search results - page 413 / 620
» Theory and Use of the EM Algorithm
Sort
View
FOCS
2004
IEEE
15 years 10 months ago
An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...
Lap Chi Lau
CVPR
2009
IEEE
15 years 10 months ago
Nonlinear Nonnegative Component Analysis
In this paper general solutions for Nonlinear Nonnegative Component Analysis for data representation and recognition are proposed. That is, motivated by a combination of the Nonne...
Stefanos Zafeiriou, Maria Petrou
ATAL
2008
Springer
15 years 9 months ago
Synthesis of strategies from interaction traces
We describe how to take a set of interaction traces produced by different pairs of players in a two-player repeated game, and combine them into a composite strategy. We provide an...
Tsz-Chiu Au, Sarit Kraus, Dana S. Nau
158
Voted
FLAIRS
2006
15 years 8 months ago
Focusing Strategies for Multiple Fault Diagnosis
Diagnosing multiple faults for a complex system is often very difficult. It requires not only a model which adequately represents the diagnostic aspect of a complex system, but al...
Tsai-Ching Lu, K. Wojtek Przytula
NIPS
2004
15 years 8 months ago
Limits of Spectral Clustering
An important aspect of clustering algorithms is whether the partitions constructed on finite samples converge to a useful clustering of the whole data space as the sample size inc...
Ulrike von Luxburg, Olivier Bousquet, Mikhail Belk...