1523 search results - page 160 / 305 » The Computational Complexity of Linear Optics |
COMPGEOM
2010
ACM
14 years 3 months ago
2010
ACM
Let G be an unweighted graph of complexity n cellularly embedded in a surface (orientable or not) of genus g. We describe improved algorithms to compute (the length of) a shortest...
CVPR
2005
IEEE
15 years 6 days ago
2005
IEEE
Statistical models for tracking different moving bodies must be able to reason about occlusions in order to be effective. Representing the joint statistics across different bodies...
AAAI
2012
12 years 18 days ago
2012
We consider the classic cake cutting problem where one allocates a divisible cake to n participating agents. Among all valid divisions, fairness and efficiency (a.k.a. social wel...
PDCAT
2005
Springer
14 years 3 months ago
2005
Springer
This paper presents a performance study of a nonrigid registration algorithm for investigating lung disease on clusters. Our algorithm combines two conventional acceleration techn...
CCA
2000
Springer
14 years 2 months ago
2000
Springer
The Exact Geometric Computing approach requires a zero test for numbers which are built up using standard operations starting with the natural numbers. The uniformity conjecture, ...