414 search results - page 13 / 83 » Geometric Semigroup Theory |
DCG
2006
13 years 7 months ago
2006
This paper sheds a new light on the split decomposition theory and T-theory from the viewpoint of convex analysis and polyhedral geometry. By regarding finite metrics as discrete ...
ICIP
2009
IEEE
13 years 5 months ago
2009
IEEE
In this paper, we present a general framework for analysis of plenoptic sampling by investigating the spectral analysis of plenoptic imaging. The proposed framework provides a uni...
COMPGEOM
2004
ACM
14 years 29 days ago
2004
ACM
We prove that the geometric thickness of graphs whose maximum degree is no more than four is two. In our proofs, we present a space and time efficient embedding technique for gra...
EATCS
2002
13 years 7 months ago
2002
We explain the essence of K. Mulmuley and M. Sohoni, "Geometric Complexity Theory I: An Approach to the P vs. NP and Related Problems" [MS02] for a general complexity-the...
GD
2009
Springer
13 years 10 months ago
2009
Springer
We show that recognizing intersection graphs of convex sets has the same complexity as deciding truth in the existential theory of the reals. Comparing this to similar results on t...