Sciweavers

1161 search results - page 68 / 233
» Approximation schemes for clustering problems
Sort
View
FOCS
2003
IEEE
15 years 10 months ago
Clustering with Qualitative Information
We consider the problem of clustering a collection of elements based on pairwise judgments of similarity and dissimilarity. Bansal, Blum and Chawla (in: Proceedings of 43rd FOCS, ...
Moses Charikar, Venkatesan Guruswami, Anthony Wirt...
79
Voted
MOC
2000
68views more  MOC 2000»
15 years 4 months ago
Numerical approximations of one-dimensional linear conservation equations with discontinuous coefficients
Conservative linear equations arise in many areas of application, including continuum mechanics or high-frequency geometrical optics approximations. This kind of equation admits mo...
Laurent Gosse, François James
133
Voted
FOCS
2004
IEEE
15 years 8 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
IPPS
2003
IEEE
15 years 10 months ago
Recovery Schemes for High Availability and High Performance Distributed Real-Time Computing
Clusters and distributed systems offer fault tolerance and high performance through load sharing, and are thus attractive in real-time applications. When all computers are up and ...
Lars Lundberg, Daniel Häggander, Kamilla Klon...
FGR
2006
IEEE
217views Biometrics» more  FGR 2006»
15 years 11 months ago
Face Recognition with Image Sets Using Hierarchically Extracted Exemplars from Appearance Manifolds
An unsupervised nonparametric approach is proposed to automatically extract representative face samples (exemplars) from a video sequence or an image set for multipleshot face rec...
Wei Fan, Dit-Yan Yeung