3341 search results - page 251 / 669 » On Bounded Queries and Approximation |
154
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
Optimizing over a variant of the Mean Optimal Subpattern Assignment (MOSPA) metric is equivalent to optimizing over the track accuracy statistic often used in target tracking benc...
194
click to vote
FOCM
2011
14 years 10 months ago
2011
We consider a wide class of semi linear Hamiltonian partial differential equations and their approximation by time splitting methods. We assume that the nonlinearity is polynomia...
161
click to vote
AAIM
2006
Springer
16 years 19 days ago
2006
Springer
Abstract. We give logarithmic approximation algorithms for the nonmetric uncapacitated multicommodity and multilevel facility location problems. The former algorithms are optimal u...
159
click to vote
ACL
2010
15 years 4 months ago
2010
We consider the search for a maximum likelihood assignment of hidden derivations and grammar weights for a probabilistic context-free grammar, the problem approximately solved by ...
181
click to vote
COCO
2005
Springer
16 years 6 days ago
2005
Springer
We introduce two new complexity measures for Boolean functions, which we name sumPI and maxPI. The quantity sumPI has been emerging through a line of research on quantum query com...