635 search results - page 43 / 127 » Some Computational Problems Related to Pseudo-intents |
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. In this paper we present a randomized constant factor approximation algorithm for the problem of computing the optimal cost of the metric Minimum Facility Location proble...
NOSSDAV
2004
Springer
15 years 3 months ago
2004
Springer
In recent years, several architectures have been proposed and developed for supporting streaming applications that take advantage of multiple paths through the network simultaneou...
LATIN
2004
Springer
15 years 3 months ago
2004
Springer
We study the problem of non-interactive correlation distillation (NICD). Suppose Alice and Bob each has a string, denoted by A = a0a1 · · · an−1 and B = b0b1 · · · bn−1,...
156
click to vote
Publication
We introduce a class of learning problems where the agent is presented with a series of tasks. Intuitively, if there is relation among those tasks, then the information gained duri...
FCT
2007
Springer
15 years 1 months ago
2007
Springer
We investigate issues regarding two hard problems related to voting, the optimal weighted lobbying problem and the winner problem for Dodgson elections. Regarding the former, Chris...