2542 search results - page 195 / 509 » Computing Cartograms with Optimal Complexity |
115
Voted
BCS
2008
15 years 2 months ago
2008
We propose a defi nition of Cellular Automaton in which links between cells can change during the computation. This is done locally by each cell, which can reach the neighbours of...
106
click to vote
ATAL
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. Control for agents situated in multi-agent systems is a complex problem. This is particularly true in hard, open, dynamic environments where resource, privacy, bandwidth,...
TCOM
2011
14 years 7 months ago
2011
—Minimizing the sum of mean squared errors using linear transceivers under a sum power constraint in the multiuser downlink is a non-convex problem. Existing algorithms exploit a...
130
click to vote
JMLR
2010
14 years 7 months ago
2010
Identifying a subset of features that preserves classification accuracy is a problem of growing importance, because of the increasing size and dimensionality of real-world data se...
134
click to vote
CGF
2011
14 years 4 months ago
2011
Efficient methods to compute intrinsic distances and geodesic paths have been presented for various types of surface representations, most importantly polygon meshes. These meshe...