434 search results - page 14 / 87 » sum 2007 |
STACS
2007
Springer
14 years 1 months ago
2007
Springer
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
IPM
2007
13 years 7 months ago
2007
In recent years, there has been increased interest in topic-focused multi-document summarization. In this task, automatic summaries are produced in response to a specific informat...
APPML
2006
13 years 7 months ago
2006
We obtain an upper bound on a new type of exponential sums with linear recurrence sequences. We apply this bound to estimate the Fourier coefficients, and thus the nonlinearity, o...
IPCO
1996
13 years 9 months ago
1996
We consider the schedulingproblem ofminimizinga weighted sum of completion times under release dates. We present a relaxation which is a supermodular polyhedron. We show that this ...
ISVLSI
2007
IEEE
14 years 1 months ago
2007
IEEE
This paper presents a quantum algorithm for finding minimal ESCT (Exclusive-or Sum of Complex Terms) or ESOP (Exclusiveor Sum Of Products) expressions for any arbitrary incomplet...