Sciweavers

190 search results - page 2 / 38
» A Simple Proof Technique for Certain Parametricity Results
Sort
View
WEA
2007
Springer
95views Algorithms» more  WEA 2007»
13 years 10 months ago
Experimental Evaluation of Parametric Max-Flow Algorithms
The parametric maximum flow problem is an extension of the classical maximum flow problem in which the capacities of certain arcs are not fixed but are functions of a single par...
Maxim A. Babenko, Jonathan Derryberry, Andrew V. G...
AAECC
2007
Springer
117views Algorithms» more  AAECC 2007»
13 years 4 months ago
A predictor-corrector-type technique for the approximate parameterization of intersection curves
Abstract We describe a method to approximate a segment of the intersection curve of two implicitly defined surfaces by a rational parametric curve. Starting from an initial soluti...
Bert Jüttler, Pavel Chalmovianský
COMPGEOM
1998
ACM
13 years 8 months ago
Geometric Applications of a Randomized Optimization Technique
Abstract. We propose a simple, general, randomized technique to reduce certain geometric optimization problems to their corresponding decision problems. These reductions increase t...
Timothy M. Chan
IJCAI
2003
13 years 5 months ago
A Tractability Result for Reasoning with Incomplete First-Order Knowledge Bases
In previous work, Levesque proposed an extension to classical databases that would allow for a certain form of incomplete first-order knowledge. Since this extension was suffici...
Yongmei Liu, Hector J. Levesque
ENDM
2007
106views more  ENDM 2007»
13 years 4 months ago
Removing Even Crossings on Surfaces
In this paper we investigate how certain results related to the HananiTutte theorem can be extended from the plane to surfaces. We give a simple topological proof that the weak Ha...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...