Sciweavers

307 search results - page 12 / 62
» On Equations over Sets of Integers
Sort
View
ANTS
1998
Springer
93views Algorithms» more  ANTS 1998»
13 years 11 months ago
Evaluation of Linear Relations between Vectors of a Lattice in Euclidean Space
We prove that to find a nontrivial integer linear relation between vectors of a lattice L IRn , whose euclidean length is at most M, one needs O n5+ (ln Mn/)1+ binary operations f...
Igor A. Semaev
SIGECOM
2008
ACM
103views ECommerce» more  SIGECOM 2008»
13 years 7 months ago
Mechanism design over discrete domains
Often, we wish to design incentive-compatible algorithms for settings in which the players' private information is drawn from discrete domains (e.g., integer values). Our mai...
Ahuva Mu'alem, Michael Schapira
IISWC
2006
IEEE
14 years 1 months ago
Performance Characterization of SPEC CPU2006 Integer Benchmarks on x86-64 Architecture
— As x86-64 processors become the CPU of choice for the personal computer market, it becomes increasingly important to understand the performance we can expect by migrating appli...
Dong Ye, Joydeep Ray, Christophe Harle, David R. K...
ANOR
2005
131views more  ANOR 2005»
13 years 7 months ago
Projection, Lifting and Extended Formulation in Integer and Combinatorial Optimization
Abstract. This is an overview of the significance and main uses of projection, lifting and extended formulation in integer and combinatorial optimization. Its first two sections de...
Egon Balas
CORR
2010
Springer
131views Education» more  CORR 2010»
13 years 6 months ago
Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding
: We develop a framework for solving polynomial equations with size constraints on solutions. We obtain our results by showing how to apply a technique of Coppersmith for finding ...
Henry Cohn, Nadia Heninger