8917 search results - page 309 / 1784 » Abstraction in Algorithm Animation |
198
click to vote
CPM
2005
Springer
16 years 5 days ago
2005
Springer
Abstract. Approximate string matching is a fundamental and challenging problem in computer science, for which a fast algorithm is highly demanded in many applications including tex...
175
click to vote
FSKD
2005
Springer
16 years 4 days ago
2005
Springer
Abstract. In this paper, we propose a novel classification algorithm, called geometrical probability covering (GPC) algorithm, to improve classification ability. On the basis of ...
157
click to vote
ICALP
2005
Springer
16 years 4 days ago
2005
Springer
Abstract. We generalize the k-means algorithm presented by the authors [14] and show that the resulting algorithm can solve a larger class of clustering problems that satisfy certa...
170
Voted
WADS
2005
Springer
16 years 3 days ago
2005
Springer
Abstract. In this paper we consider a generalization of the edge dominating set (EDS) problem, in which each edge e needs to be covered be times and refer to this as the b-EDS prob...
189
click to vote
ESA
2004
Springer
16 years 15 hour ago
2004
Springer
Abstract. We obtain faster algorithms for problems such as rdimensional matching, r-set packing, graph packing, and graph edge packing when the size k of the solution is considered...