1161 search results - page 46 / 233 » Approximation schemes for clustering problems |
APPML
2005
14 years 9 months ago
2005
Three iterative refinement schemes are studied for approximating the solutions of linear weakly singular Fredholm integral equations of the second kind. The rates of convergence a...
76
Voted
LATIN
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We introduce the NP-hard graph-based data clustering problem s-Plex Cluster Vertex Deletion, where the task is to delete at most k vertices from a graph so that the conne...
DASFAA
2003
IEEE
15 years 3 months ago
2003
IEEE
Approximate string matching on large DNA sequences data is very important in bioinformatics. Some studies have shown that suffix tree is an efficient data structure for approxim...
104
click to vote
PODS
2006
ACM
15 years 9 months ago
2006
ACM
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
ORL
2008
14 years 9 months ago
2008
We propose a sample average approximation (SAA) method for stochastic programming problems involving an expected value constraint. Such problems arise, for example, in portfolio s...