6142 search results - page 124 / 1229 » The Complexity of Partition Functions |
CORR
2010
Springer
14 years 6 months ago
2010
Springer
Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on...
CSREAESA
2004
14 years 11 months ago
2004
- The model of a simple perceptron using phase-encoded inputs and complex-valued weights is presented. Multilayer two-input and three-input complex-valued neurons (CVNs) are implem...
FSTTCS
2008
Springer
14 years 11 months ago
2008
Springer
A sup-interpretation is a tool which provides upper bounds on the size of the values computed by the function symbols of a program. Sup-interpretations have shown their interest to...
FOCS
2010
IEEE
14 years 8 months ago
2010
IEEE
It is widely suspected that Erdos-R
103
click to vote
CVPR
2009
IEEE
16 years 5 months ago
2009
IEEE
The ability to constrain the geometry of deformable models for image segmentation can be useful when information about the expected shape or positioning of the objects in a scene i...