2542 search results - page 119 / 509 » Computing Cartograms with Optimal Complexity |
111
Voted
ANOR
2010
15 years 3 months ago
2010
The design of effective neighborhood structures is fundamentally important for creating better local search and metaheuristic algorithms for combinatorial optimization. Significant...
224
click to vote
CP
2009
Springer
16 years 4 months ago
2009
Springer
The goal of testing is to distinguish between a number of hypotheses about a systemfor example, dierent diagnoses of faults by applying input patterns and verifying or falsifying t...
EMMCVPR
2009
Springer
15 years 10 months ago
2009
Springer
7th International Conference on Energy Minimization Methods in Computer Vision and Pattern Recognition, Bonn, Germany, August 24-27, 2009 Bayesian boundary models often assume tha...
114
Voted
IPPS
2000
IEEE
15 years 7 months ago
2000
IEEE
In this paper, we consider the problem of nding llpreserving ordering of a sparse symmetric and positive de nite matrix such that the reordered matrix is suitable for parallel fac...
115
click to vote
ICC
2007
IEEE
15 years 9 months ago
2007
IEEE
— In this paper, we extend the optimal worst-case QoS routing algorithm and metric definition given in [1]. We prove that in addition to the q-ary symmetric and q-ary erasure ch...