2957 search results - page 174 / 592 » The Complexity of Polynomial-Time Approximation |
132
click to vote
DLT
2007
15 years 7 months ago
2007
Abstract. Inapproximability results concerning minimization of nondeterministic finite automata relative to given deterministic finite automata were obtained only recently, modul...
172
click to vote
COCO
2007
Springer
15 years 10 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...
188
click to vote
ICA
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Recently, the authors developed the Minimax Mutual Information algorithm for linear ICA of real-valued mixtures, which is based on a density estimate stemming from Jaynes...
169
Voted
WACV
2002
IEEE
15 years 11 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...
150
click to vote
ATAL
2001
Springer
15 years 10 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...