2542 search results - page 18 / 509 » Computing Cartograms with Optimal Complexity |
CAD
2005
Springer
13 years 7 months ago
2005
Springer
Since the publication of the original Marching Cubes algorithm, numerous variations have been proposed for guaranteeing water-tight constructions of triangulated approximations of...
FECS
2010
13 years 5 months ago
2010
In this paper, we present a method to help teach computer architecture (or computer organization) by developing an in class system where the students, themselves, compile high-leve...
PODC
2012
ACM
11 years 10 months ago
2012
ACM
Multi-party communication complexity involves distributed computation of a function over inputs held by multiple distributed players. A key focus of distributed computing research...
ICIP
2000
IEEE
14 years 9 months ago
2000
IEEE
In this paper, we study rate-complexity-distortion (R-C-D) tradeoffs for video coding, where we focus on the complexity of computing the inverse DCT. A quadtree coding approach is...
ICIC
2007
Springer
14 years 1 months ago
2007
Springer
: - This paper introduces the main ideas of the nested partitions (NP) method, analyses its efficiency theoretically and proposes the way to improve the optimization efficiency of ...