2542 search results - page 249 / 509 » Computing Cartograms with Optimal Complexity |
101
Voted
SI3D
2009
ACM
15 years 7 months ago
2009
ACM
Lines drawn over or in place of shaded 3D models can often provide greater comprehensibility and stylistic freedom that shading alone. A substantial challenge for making stylized ...
100
click to vote
NOCS
2007
IEEE
15 years 6 months ago
2007
IEEE
Many DSP algorithms are very computationally intensive. They are typically implemented using an ensemble of processing elements (PEs) operating in parallel. The results from PEs n...
SC
2004
ACM
15 years 6 months ago
2004
ACM
The solution of elliptic diffusion operators is the computational bottleneck in many simulations in a wide range of engineering and scientific disciplines. We present a truly sca...
UAI
2001
15 years 1 months ago
2001
In this paper we present three different architectures for the evaluation of influence diagrams: HUGIN, Shafer-Shenoy (S-S), and Lazy Propagation (LP). HUGIN and LP are two new ar...
105
click to vote
ISMB
1994
15 years 1 months ago
1994
Multiple sequence alignment has been a useful methodin the study of molecular evolution and sequence-structure relationships. This paper presents a newmethodfor multiple sequence ...