Sciweavers

80 search results - page 3 / 16
» A natural lattice basis problem with applications
Sort
View
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
CORR
2006
Springer
156views Education» more  CORR 2006»
13 years 7 months ago
Complex Lattice Reduction Algorithm for Low-Complexity MIMO Detection
Recently, lattice-reduction-aided detectors have been proposed for multiple-input multiple-output (MIMO) systems to give performance with full diversity like maximum likelihood rec...
Ying Hung Gan, Cong Ling, Wai Ho Mow
ICRA
2009
IEEE
259views Robotics» more  ICRA 2009»
14 years 2 months ago
Constructing action set from basis functions for reinforcement learning of robot control
Abstract— Continuous action sets are used in many reinforcement learning (RL) applications in robot control since the control input is continuous. However, discrete action sets a...
Akihiko Yamaguchi, Jun Takamatsu, Tsukasa Ogasawar...
SIAMSC
2008
191views more  SIAMSC 2008»
13 years 7 months ago
ORBIT: Optimization by Radial Basis Function Interpolation in Trust-Regions
Abstract. We present a new derivative-free algorithm, ORBIT, for unconstrained local optimization of computationally expensive functions. A trust-region framework using interpolati...
Stefan M. Wild, Rommel G. Regis, Christine A. Shoe...
JCSS
2008
73views more  JCSS 2008»
13 years 7 months ago
Structure identification of Boolean relations and plain bases for co-clones
We give a quadratic algorithm for the following structure identification problem: given a Boolean relation R and a finite set S of Boolean relations, can the relation R be express...
Nadia Creignou, Phokion G. Kolaitis, Bruno Zanutti...