Sciweavers

358 search results - page 4 / 72
» GCD of Many Integers
Sort
View
CCCG
2009
13 years 8 months ago
Every Large Point Set contains Many Collinear Points or an Empty Pentagon
We prove the following generalised empty pentagon theorem: for every integer 2, every sufficiently large set of points in the plane contains collinear points or an empty pentagon...
Zachary Abel, Brad Ballinger, Prosenjit Bose, S&ea...
FCSC
2008
88views more  FCSC 2008»
13 years 7 months ago
Fraction-free matrix factors: new forms for LU and QR factors
Gaussian elimination and LU factoring have been greatly studied from the algorithmic point of view, but much less from the point view of the best output format. In this paper, we g...
Wenqin Zhou, David J. Jeffrey
CORR
2010
Springer
149views Education» more  CORR 2010»
13 years 4 months ago
Constructions of Optical Queues With a Limited Number of Recirculations--Part II: Optimal Constructions
One of the main problems in all-optical packet-switched networks is the lack of optical buffers, and one feasible technology for the constructions of optical buffers is to use opt...
Xuan-Chao Huang, Jay Cheng
ISAAC
2009
Springer
121views Algorithms» more  ISAAC 2009»
14 years 2 months ago
Generalized Reduction to Compute Toric Ideals
Toric ideals have many applications including solving integer programs. Several algorithms for computing the toric ideal of an integer matrix are available in the literature. Since...
Deepanjan Kesh, Shashank K. Mehta
CC
2005
Springer
115views System Software» more  CC 2005»
14 years 1 months ago
Experiences with Enumeration of Integer Projections of Parametric Polytopes
Abstract. Many compiler optimization techniques depend on the ability to calculate the number of integer values that satisfy a given set of linear constraints. This count (the enum...
Sven Verdoolaege, Kristof Beyls, Maurice Bruynoogh...