2542 search results - page 355 / 509 » Computing Cartograms with Optimal Complexity |
LCPC
2005
Springer
14 years 3 months ago
2005
Springer
Tera-scale high-performance computing has enabled scientists to tackle very large and computationally challenging scientific problems, making the advancement of scientific discov...
IPPS
1994
IEEE
14 years 2 months ago
1994
IEEE
The matrix chain ordering problem is to find the cheapest way to multiply a chain of n matrices, where the matrices are pairwise compatible but of varying dimensions. Here we give ...
SIGGRAPH
1990
ACM
14 years 2 months ago
1990
ACM
The use of physically-based techniques for computer animation can result in realistic object motion. The price paid for physically-based motion synthesis lies in increased computa...
CIDM
2007
IEEE
14 years 2 months ago
2007
IEEE
Kernel methods are effective approaches to the modeling of structured objects in learning algorithms. Their major drawback is the typically high computational complexity of kernel ...
ATAL
2010
Springer
13 years 11 months ago
2010
Springer
We consider collusion in multi-unit auctions where the allocation and payments are determined using the VCG mechanism. We show how collusion can increase the utility of the collud...