Sciweavers

2040 search results - page 76 / 408
» Approximate Expectation Maximization
Sort
View
DIS
2007
Springer
15 years 5 months ago
On Approximating Minimum Infrequent and Maximum Frequent Sets
The maximum cardinality of a frequent set as well as the minimum cardinality of an infrequent set are important characteristic numbers in frequent (item) set mining. Gunopulos et a...
Mario Boley
ESA
2005
Springer
136views Algorithms» more  ESA 2005»
15 years 5 months ago
Approximating the 2-Interval Pattern Problem
We address the problem of approximating the 2-Interval Pattern problem over its various models and restrictions. This problem, which is motivated by RNA secondary structure predict...
Maxime Crochemore, Danny Hermelin, Gad M. Landau, ...
SODA
2004
ACM
146views Algorithms» more  SODA 2004»
15 years 27 days ago
Approximating the two-level facility location problem via a quasi-greedy approach
We propose a quasi-greedy algorithm for approximating the classical uncapacitated 2-level facility location problem (2-LFLP). Our algorithm, unlike the standard greedy algorithm, ...
Jiawei Zhang
IPL
2006
105views more  IPL 2006»
14 years 11 months ago
A new approximation algorithm for labeling points with circle pairs
We study the NP-hard problem of labeling points with maximum-radius circle pairs: given n point sites in the plane, find a placement for 2n interior-disjoint uniform circles, such...
Minghui Jiang
TAMC
2009
Springer
15 years 6 months ago
Approximability and Fixed-Parameter Tractability for the Exemplar Genomic Distance Problems
In this paper, we present a survey of the approximability and fixed-parameter tractability results for some Exemplar Genomic Distance problems. We mainly focus on three problems: ...
Binhai Zhu