5595 search results - page 82 / 1119 » Approximation Algorithms for Clustering Problems |
122
click to vote
ECML
2006
Springer
15 years 8 months ago
2006
Springer
In this paper we formulate the problem of grouping the states of a discrete Markov chain of arbitrary order simultaneously with deconvolving its transition probabilities. As the na...
115
click to vote
WEBI
2005
Springer
15 years 10 months ago
2005
Springer
Web page clustering is a technology that puts semantically related web pages into groups and is useful for categorizing, organizing, and refining search results. When clustering ...
117
click to vote
ACISICIS
2009
IEEE
15 years 8 months ago
2009
IEEE
—This paper presents a parallel algorithm for computer simulation of Electrocardiogram (ECG) based on a 3-dimensional (3D) whole-heart model. The computer heart model includes ap...
163
click to vote
ESA
2005
Springer
15 years 10 months ago
2005
Springer
We present two polynomial-time approximation algorithms for the metric case of the maximum traveling salesman problem. One of them is for directed graphs and its approximation rat...
108
click to vote
FOCM
2007
15 years 4 months ago
2007
Isolated multiple zeros or clusters of zeros of analytic maps with several variables are known to be difficult to locate and approximate. This article is in the vein of the α-theo...