2542 search results - page 215 / 509 » Computing Cartograms with Optimal Complexity |
123
click to vote
IEEEPACT
2009
IEEE
15 years 7 months ago
2009
IEEE
—Analytical models have been used to estimate optimal values for parameters such as tile sizes in the context of loop nests. However, important algorithms such as fast Fourier tr...
102
click to vote
IDA
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Binary Factor Analysis (BFA) is a typical problem of Independent Component Analysis (ICA) where the signal sources are binary. Parameter learning and model selection in B...
113
click to vote
ICIP
2003
IEEE
15 years 6 months ago
2003
IEEE
We propose a new algorithm for the real-time control of an interframe video coder operating with a variable rate channel such as wireless channels or the Internet. Using technique...
113
Voted
TPCG
2003
IEEE
15 years 6 months ago
2003
IEEE
In many application areas an optimal visualization of a complex graph depends on the specific task to be accomplished by the user. Therefore a means of locally customizable layou...
GECCO
2006
Springer
15 years 4 months ago
2006
Springer
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...