3875 search results - page 457 / 775 » Approximation algorithms for the 0-extension problem |
174
click to vote
FOCS
2003
IEEE
16 years 9 hour ago
2003
IEEE
The degree of a polynomial representing (or approximating) a function f is a lower bound for the quantum query complexity of f. This observation has been a source of many lower bo...
162
click to vote
ACL
1994
15 years 8 months ago
1994
The computational lexicalization of a grammar is the optimization of the links between lexicalized rules and lexical items in order to improve the quality of the bottom-up filteri...
198
click to vote
IJRR
2000
15 years 6 months ago
2000
In this paper, we study the problem of determining a mathematical description of the surface defined by the shape of a membrane based on an image of it and present an algorithm fo...
173
click to vote
ICIP
2010
IEEE
15 years 4 months ago
2010
IEEE
Based on the theory of Markov Random Fields, a Bayesian regularization model for diffusion tensor images (DTI) is proposed in this paper. The low-degree parameterization of diffus...
167
click to vote
ICCV
2009
IEEE
15 years 4 months ago
2009
IEEE
A new problem of retrieving social games from unstructured videos is proposed. Social games are characterized by repetitions (with variations) of alternating turns between two pla...