752 search results - page 79 / 151 » Faster approximation algorithms for the minimum latency prob... |
148
click to vote
PAKDD
2009
ACM
16 years 15 days ago
2009
ACM
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
131
Voted
FOCS
2008
IEEE
15 years 9 months ago
2008
IEEE
In the Survivable Network Design Problem (SNDP) the goal is to find a minimum cost subset of edges that satisfies a given set of pairwise connectivity requirements among the ver...
125
Voted
SODA
2000
ACM
15 years 4 months ago
2000
ACM
The Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices terminals. We present a new polynomial-time heurist...
163
click to vote
CORR
2011
Springer
14 years 7 months ago
2011
Springer
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. Thi...
116
Voted
ICCSA
2010
Springer
15 years 10 months ago
2010
Springer
String matching with mismatches is a basic concept of information retrieval with some kinds of approximation. This paper proposes an FFT-based algorithm for the problem of string ...