2542 search results - page 84 / 509 » Computing Cartograms with Optimal Complexity |
127
Voted
IPL
2002
15 years 2 months ago
2002
We consider the problem of decomposing polygons (with holes) into various types of simpler polygons. We focus on the problem of partitioning a rectilinear polygon, with holes, int...
117
Voted
VTC
2010
IEEE
15 years 29 days ago
2010
IEEE
—In this paper, we introduce a collision model for vehicular cluster and we propose path selection algorithms for multi-hop VANETs. That is, we propose the intuitive algorithm na...
97
Voted
GLOBECOM
2006
IEEE
15 years 8 months ago
2006
IEEE
— In upstream vectored DSL transmission, the far-end crosstalk (FEXT) can be completely cancelled by using zeroforcing generalized decision-feedback equalizers (ZF-GDFE). When th...
229
Voted
ICLP
2009
Springer
16 years 3 months ago
2009
Springer
Abstract. A class of probabilistic-logic models is considered, which increases the expressibility from HMM's and SCFG's regular and contextfree languages to, in principle...
118
Voted
CAIP
1999
Springer
15 years 7 months ago
1999
Springer
Abstract. In this article, we deal with fast algorithms for the quaternionic Fourier transform (QFT). Our aim is to give a guideline for choosing algorithms in practical cases. Hen...