2542 search results - page 95 / 509 » Computing Cartograms with Optimal Complexity |
119
click to vote
ICCS
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Hierarchical (H)-matrices approximate full or sparse matrices using a hierarchical data sparse format. The corresponding H-matrix arithmetic reduces the time complexity o...
137
click to vote
ICPP
1993
IEEE
15 years 7 months ago
1993
IEEE
SIMD or vector computers and collection-oriented languages, like C , are designed to perform the same computation on each data item or on just a subset of the data. Subsets of pro...
104
Voted
TNN
1998
15 years 3 months ago
1998
— In this paper, we study a qualitative property of a class of competitive learning (CL) models, which is called the multiplicatively biased competitive learning (MBCL) model, na...
158
click to vote
GLOBECOM
2009
IEEE
15 years 1 months ago
2009
IEEE
Abstract--We consider a set of multicast sources, each multicasting a finite amount of data to its corresponding destinations. The objective is to minimize the time to deliver all ...
121
Voted
ICRA
2009
IEEE
15 years 10 months ago
2009
IEEE
— This article addresses the fast solution of a Quadratic Program underlying a Linear Model Predictive Control scheme that generates walking motions. We introduce an algorithm wh...