2542 search results - page 41 / 509 » Computing Cartograms with Optimal Complexity |
117
click to vote
CCGRID
2008
IEEE
15 years 9 months ago
2008
IEEE
In this paper we present a multicost algorithm for the joint time scheduling of the communication and computation resources that will be used by a task. The proposed algorithm sel...
143
Voted
CCECE
2006
IEEE
15 years 8 months ago
2006
IEEE
Multiuser detection (MUD) techniques are known to improve the performance of CDMA cellular communication systems. This performance improvement usually comes at a large computation...
106
click to vote
BIRTHDAY
2003
Springer
15 years 7 months ago
2003
Springer
The pagination problem of complex documents is in placing text and floating objects on pages in such a way that each object appears close to, but not before, its text reference. ...
122
click to vote
ICMLC
2010
Springer
15 years 13 days ago
2010
Springer
: Bagging (Bootstrap Aggregating) has been proved to be a useful, effective and simple ensemble learning methodology. In generic bagging methods, all the classifiers which are trai...
238
click to vote
ICC
2011
IEEE
14 years 2 months ago
2011
IEEE
—Ant colony optimization (ACO) is a probabilistic technique used for solving complex computational problems, such as finding optimal routes in networks. It has been proved to pe...