4894 search results - page 302 / 979 » The Guarding Problem - Complexity and Approximation |
169
click to vote
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
— Approximating the sum of Log–Normal random variables (RVs) is a long–standing open issue, in the old and recent literature, and many approaches have been proposed to deal w...
162
click to vote
ICALP
2007
Springer
16 years 25 days ago
2007
Springer
We consider the problem of private efficient data mining of vertically-partitioned databases. Each of several parties holds a column of a data matrix (a vector) and the parties wan...
190
click to vote
DMSN
2004
ACM
16 years 2 days ago
2004
ACM
Recent work in sensor databases has focused extensively on distributed query problems, notably distributed computation of aggregates. Existing methods for computing aggregates bro...
142
click to vote
EVOW
1999
Springer
15 years 11 months ago
1999
Springer
This paper describes a new approximate approach for checking the correctness of the implementation of a protocol interface, comparing its lowlevel implementation with its high-leve...
171
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. In this work we study the tractability of well supported approximate Nash Equilibria (SuppNE in short) in bimatrix games. In view of the apparent intractability of constr...