2520 search results - page 64 / 504 » The complexity of approximating entropy |
COCO
2007
Springer
15 years 2 months ago
2007
Springer
We prove new results on the circuit complexity of Approximate Majority, which is the problem of computing Majority of a given bit string whose fraction of 1's is bounded away...
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
We prove that the problem of computing an Arrow-Debreu market equilibrium is PPAD-complete even when all traders use additively separable, piecewise-linear and concave utility fun...
WACV
2002
IEEE
15 years 3 months ago
2002
IEEE
3D models of urban sites with geometry and facade textures are needed for many planning and visualization applications. Approximate 3D wireframe model can be derived from aerial i...
ATAL
2001
Springer
15 years 2 months ago
2001
Springer
We present a simple model of distributed multi-agent multi-issued contract negotiation for open systems where interactions are competitive and information is private and not shared...
IJFCS
2006
14 years 10 months ago
2006
We initiate a systematic study of the Row Deletion(B) problem on matrices: Given an input matrix A and a fixed "forbidden submatrix" B, the task is to remove a minimum n...