90 search results - page 12 / 18 » Formalizing complex plane geometry |
120
click to vote
CVPR
2009
IEEE
16 years 4 months ago
2009
IEEE
We present a new method for classification with structured
latent variables. Our model is formulated using the
max-margin formalism in the discriminative learning literature.
We...
AI
2007
Springer
15 years 3 months ago
2007
Springer
DEC-POMDPs provide formal models of many cooperative multiagent problems, but their complexity is NEXP-complete in general. We investigate a sub-class of DEC-POMDPs termed multiage...
ISMVL
2006
IEEE
15 years 3 months ago
2006
IEEE
We define the MaxSAT problem for many-valued CNF formulas, called many-valued MaxSAT, and establish its complexity class. We then describe a basic branch and bound algorithm for ...
VC
2010
14 years 8 months ago
2010
Abstract Digital holography is a technology with a potential to provide realistic 3D images. However, generation of digital holograms is a computationally demanding task. Thus, the...
COMPGEOM
2000
ACM
15 years 2 months ago
2000
ACM
Let A be the incidence matrix of a set system with m sets and n points, m ≤ n, and let t = tr M, where M = AT A. Finally, let σ = tr M2 be the sum of squares of the elements of ...