1672 search results - page 193 / 335 » Tightness problems in the plane |
102
click to vote
MOBIHOC
2008
ACM
15 years 10 months ago
2008
ACM
In this paper we analyze the complexity of scheduling wireless links in the physical interference model with analog network coding capability. We study two models with different d...
COMPGEOM
2006
ACM
15 years 5 months ago
2006
ACM
Persistent homology is the mathematical core of recent work on shape, including reconstruction, recognition, and matching. Its pertinent information is encapsulated by a pairing o...
CP
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. Refutation proofs can be viewed as a special case of constraint propagation, which is a fundamental technique in solving constraint-satisfaction problems. The generalizat...
109
click to vote
FOCS
2002
IEEE
15 years 4 months ago
2002
IEEE
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
COMPGEOM
2005
ACM
15 years 1 months ago
2005
ACM
An open question in Exact Geometric Computation is whether there are transcendental computations that can be made “geometrically exact”. Perhaps the simplest such problem in c...