2542 search results - page 40 / 509 » Computing Cartograms with Optimal Complexity |
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
Recent research has revealed that circularity (or, propriety) of complex random signals can be exploited in developing optimal signal processors. In this paper, a robust estimator...
STOC
1996
ACM
13 years 12 months ago
1996
ACM
We study the complexity of computing Boolean functions using AND, OR and NOT gates. We show that a circuit of depth d with S gates can be made to output a constant by setting O(S1...
DAC
1998
ACM
13 years 12 months ago
1998
ACM
We present a technique for synthesizing power- as well as area-optimized circuits from hierarchical data flow graphs under throughput constraints. We allow for the use of complex...
VR
2000
IEEE
13 years 11 months ago
2000
IEEE
Virtual environments have shown great promise as a research tool in science and engineering. In this paper we study a classical problem in mathematics: that of approximating globa...
AI
2005
Springer
13 years 7 months ago
2005
Springer
The use of software agents for automatic contract negotiation in e-commerce and e-trading ents has been the subject of considerable recent interest. A widely studied abstract mode...