Sciweavers

778 search results - page 23 / 156
» Bounding Smooth Integers
Sort
View
CAGD
2010
128views more  CAGD 2010»
13 years 7 months ago
Construction and smoothing of triangular Coons patches with geodesic boundary curves
Given three regular space curves r1(t), r2(t) r3(t), t [ 0, 1 ] that define a curvilinear triangle, we consider the problem of constructing a C2 triangular surface patch R(u1, u2...
Rida T. Farouki, Nicolas Szafran, Luc Biard
DM
2010
129views more  DM 2010»
13 years 7 months ago
Interpolating between bounds on the independence number
For a non-negative integer T, we prove that the independence number of a graph G = (V, E) in which every vertex belongs to at most T triangles is at least uV f(d(u), T) where d(u)...
Anett Boßecker, Dieter Rautenbach
4OR
2006
100views more  4OR 2006»
13 years 7 months ago
Nondecomposable solutions to group equations and an application to polyhedral combinatorics
This paper is based on the study of the set of nondecomposable integer solutions in a Gomory corner polyhedron, which was recently used in a reformulation method for integer linear...
Matthias Jach, Matthias Köppe, Robert Weisman...
MOC
1998
65views more  MOC 1998»
13 years 7 months ago
Solving constrained Pell equations
Consider the system of Diophantine equations x2 − ay2 = b, P (x, y) = z2, where P is a given integer polynomial. Historically, such systems have been analyzed by using Baker’s ...
Kiran S. Kedlaya
DISOPT
2008
138views more  DISOPT 2008»
13 years 7 months ago
An algorithmic framework for convex mixed integer nonlinear programs
This paper is motivated by the fact that mixed integer nonlinear programming is an important and difficult area for which there is a need for developing new methods and software f...
Pierre Bonami, Lorenz T. Biegler, Andrew R. Conn, ...