4860 search results - page 114 / 972 » SNPs Problems, Complexity, and Algorithms |
WSCG
2004
13 years 11 months ago
2004
Inverse rendering infers realistic descriptions of illumination and material properties from photographs. However, the applicability of state of the art inverse rendering algorith...
WAOA
2005
Springer
14 years 3 months ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
FCT
2007
Springer
14 years 4 months ago
2007
Springer
We present quantum query complexity bounds for testing algebraic properties. For a set S and a binary operation on S, we consider the decision problem whether S is a semigroup or ...
COLING
1990
13 years 11 months ago
1990
Tense and aspect, together with mood and modality, usually form the entangled structure of a complex verb. They are often hard to translate by machines, because of both syntactic ...
CVPR
2012
IEEE
12 years 16 days ago
2012
IEEE
A large number of problems in computer vision can be modeled as energy minimization problems in a markov random field (MRF) framework. Many methods have been developed over the y...