Sciweavers

861 search results - page 19 / 173
» Faster integer multiplication
Sort
View
MOC
2010
13 years 2 months ago
The number field sieve for integers of low weight
We define the weight of an integer N to be the smallest w such that N can be represented as w i=1 i2ci , with 1,..., w{1,-1}. Since arithmetic modulo a prime of low weight is parti...
Oliver Schirokauer
CP
2009
Springer
14 years 8 months ago
Solving a Location-Allocation Problem with Logic-Based Benders' Decomposition
Abstract. We address a location-allocation problem that requires deciding the location of a set of facilities, the allocation of customers to those facilities under facility capaci...
Mohammad M. Fazel-Zarandi, J. Christopher Beck
MP
2010
126views more  MP 2010»
13 years 6 months ago
Two row mixed-integer cuts via lifting
Recently, Andersen et al. [1], Borozan and Cornu´ejols [7] and Cornu´ejols and Margot [10] characterized extreme inequalities of a system of two rows with two free integer varia...
Santanu S. Dey, Laurence A. Wolsey
SIGIR
2011
ACM
12 years 10 months ago
Faster temporal range queries over versioned text
Versioned textual collections are collections that retain multiple versions of a document as it evolves over time. Important large-scale examples are Wikipedia and the web collect...
Jinru He, Torsten Suel
CVPR
2010
IEEE
14 years 4 months ago
Noise-Optimal Capture for High Dynamic Range Photography
Taking multiple exposures is a well-established approach both for capturing high dynamic range (HDR) scenes and for noise reduction. But what is the optimal set of photos to captur...
Samuel W. Hasinoff, Frédo Durand, and William T. ...