344 search results - page 8 / 69 » On the Discrete Symmetric Localization Problem |
76
Voted
CGF
2008
14 years 10 months ago
2008
We present a spectral approach to automatically and efficiently obtain discrete free-boundary conformal parameterizations of triangle mesh patches, without the common artifacts du...
121
Voted
SODA
2010
ACM
15 years 7 months ago
2010
ACM
The quadratic assignment problem (QAP) is a central problem in combinatorial optimization. Several famous computationally hard tasks, such as graph matching, partitioning, and the...
102
click to vote
PE
2011
Springer
14 years 5 months ago
2011
Springer
Performance and dependability evaluation of complex systems by means of dynamic stochastic models (e.g. Markov chains) may be impaired by the combinatorial explosion of their stat...
HEURISTICS
2002
14 years 10 months ago
2002
Neighborhood search heuristics like local search and its variants are some of the most popular approaches to solve discrete optimization problems of moderate to large size. Apart ...
101
click to vote
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
We consider the problem of fitting a discrete curve to time-labeled data points on the set Pn of all n-by-n symmetric positive-definite matrices. The quality of a curve is measu...