2957 search results - page 131 / 592 » The Complexity of Polynomial-Time Approximation |
142
click to vote
FSS
2010
15 years 3 months ago
2010
In this paper we extend the geometric approach to the theory of evidence in order to include the class of necessity measures, represented on a finite domain of “frame” by con...
152
click to vote
ICML
2005
IEEE
16 years 5 months ago
2005
IEEE
We present a novel algorithm for agglomerative hierarchical clustering based on evaluating marginal likelihoods of a probabilistic model. This algorithm has several advantages ove...
272
click to vote
ICLP
2009
Springer
16 years 5 months ago
2009
Springer
We extend to disjunctive logic programs our previous work on computing loop formulas of loops with at most one external support. We show that for these logic programs, loop formula...
120
Voted
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
In many settings the power of truthful mechanisms is severely bounded. In this paper we use randomization to overcome this problem. In particular, we construct an FPTAS for multi-...
147
click to vote
INFOCOM
2009
IEEE
15 years 11 months ago
2009
IEEE
—Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For sca...