5595 search results - page 322 / 1119 » Approximation Algorithms for Clustering Problems |
191
click to vote
IPL
2008
15 years 6 months ago
2008
We consider the problem of computing shortest paths in three-dimensions in the presence of a single-obstacle polyhedral terrain, and present a new algorithm that for any p 1, comp...
181
click to vote
ALT
2004
Springer
16 years 3 months ago
2004
Springer
We consider a two-layer network algorithm. The first layer consists of an uncountable number of linear units. Each linear unit is an LMS algorithm whose inputs are first “kerne...
175
click to vote
ISPAN
1997
IEEE
15 years 11 months ago
1997
IEEE
Abstract- String matching problem received much attention over the years due to its importance in various applications such as text/file comparison, DNA sequencing, search engines,...
170
click to vote
AAAI
1992
15 years 7 months ago
1992
models require the identi cation of abstractions and approximations that are well suited to the task at hand. In this paper we analyze the problem of automatically selecting adequ...
196
click to vote
CVPR
2003
IEEE
16 years 8 months ago
2003
IEEE
We address the problem of robust clustering by combining data partitions (forming a clustering ensemble) produced by multiple clusterings. We formulate robust clustering under an ...