Sciweavers

1161 search results - page 53 / 233
» Approximation schemes for clustering problems
Sort
View
WG
2004
Springer
15 years 3 months ago
A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs
A unit disk graph is the intersection graph of unit disks in the euclidean plane. We present a polynomial-time approximation scheme for the maximum weight independent set problem i...
Tim Nieberg, Johann Hurink, Walter Kern
MOC
1998
126views more  MOC 1998»
14 years 9 months ago
Implicit-explicit multistep finite element methods for nonlinear parabolic problems
We approximate the solution of initial boundary value problems for nonlinear parabolic equations. In space we discretize by finite element methods. The discretization in time is b...
Georgios Akrivis, Michel Crouzeix, Charalambos Mak...
SIGIR
2010
ACM
14 years 10 months ago
Optimal meta search results clustering
By analogy with merging documents rankings, the outputs from multiple search results clustering algorithms can be combined into a single output. In this paper we study the feasibi...
Claudio Carpineto, Giovanni Romano
TIT
2002
126views more  TIT 2002»
14 years 9 months ago
Two-dimensional interleaving schemes with repetitions: Constructions and bounds
Abstract--Two-dimensional interleaving schemes with repetitions are considered. These schemes are required for the correction of two-dimensional bursts (or clusters) of errors in a...
Tuvi Etzion, Alexander Vardy
CVPR
2006
IEEE
15 years 11 months ago
Recursive estimation of generative models of video
In this paper we present a generative model and learning procedure for unsupervised video clustering into scenes. The work addresses two important problems: realistic modeling of ...
Nemanja Petrovic, Aleksandar Ivanovic, Nebojsa Joj...