Sciweavers

778 search results - page 122 / 156
» Bounding Smooth Integers
Sort
View
ATMOS
2007
152views Optimization» more  ATMOS 2007»
13 years 9 months ago
Solution of the Train Platforming Problem
In this paper we study a general formulation of the train platforming problem, which contains as special cases all the versions previously considered in the literature as well as a...
Alberto Caprara, Laura Galli, Paolo Toth
ACISP
2010
Springer
13 years 9 months ago
Solving Generalized Small Inverse Problems
We introduce a "generalized small inverse problem (GSIP)" and present an algorithm for solving this problem. GSIP is formulated as finding small solutions of f(x0, x1, . ...
Noboru Kunihiro
NIPS
2008
13 years 9 months ago
Clustering via LP-based Stabilities
A novel center-based clustering algorithm is proposed in this paper. We first formulate clustering as an NP-hard linear integer program and we then use linear programming and the ...
Nikos Komodakis, Nikos Paragios, Georgios Tziritas
PDPTA
2003
13 years 9 months ago
Quaternary Arithmetic Logic Unit on a Programmable Logic Device
Common binary arithmetic operations such as addition/subtraction and multiplication suffer from O(n) carry propagation delay where n is the number of digits. Carry lookahead helps...
Songpol Ongwattanakul, Phaisit Chewputtanagul, Dav...
IPCO
1996
104views Optimization» more  IPCO 1996»
13 years 9 months ago
An Optimal, Stable Continued Fraction Algorithm
We analyse a continued fraction algorithm (abbreviated CFA) for arbitrary dimension n showing that it produces simultaneous diophantine approximations which are up to the factor 2(...
Carsten Rössner, Claus-Peter Schnorr