17049 search results - page 3159 / 3410 » cans 2007 |
193
click to vote
STACS
2007
Springer
16 years 21 days 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...
167
click to vote
STACS
2007
Springer
16 years 21 days ago
2007
Springer
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
188
click to vote
STACS
2007
Springer
16 years 21 days ago
2007
Springer
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
195
click to vote
TARK
2007
Springer
16 years 21 days ago
2007
Springer
We contend that reasoning about knowledge is both natural and pragmatic for verification of electronic voting protocols. We present a model in which desirable properties of elect...
176
click to vote
TCC
2007
Springer
16 years 21 days ago
2007
Springer
Abstract. Secret-sharing schemes are an important tool in cryptography that is used in the construction of many secure protocols. However, the shares’ size in the best known secr...