Sciweavers

19866 search results - page 183 / 3974
» Computing all factorizations in ***
Sort
View
STOC
1999
ACM
176views Algorithms» more  STOC 1999»
15 years 10 months ago
On the Complexity of Computing Short Linearly Independent Vectors and Short Bases in a Lattice
Motivated by Ajtai’s worst-case to average-case reduction for lattice problems, we study the complexity of computing short linearly independent vectors (short basis) in a lattic...
Johannes Blömer, Jean-Pierre Seifert
EDBT
2010
ACM
180views Database» more  EDBT 2010»
16 years 1 months ago
BSkyTree: scalable skyline computation using a balanced pivot selection
Skyline queries have gained a lot of attention for multicriteria analysis in large-scale datasets. While existing skyline algorithms have focused mostly on exploiting data dominan...
Jongwuk Lee, Seung-won Hwang
FMSD
2006
104views more  FMSD 2006»
15 years 6 months ago
Some ways to reduce the space dimension in polyhedra computations
Convex polyhedra are often used to approximate sets of states of programs involving numerical variables. The manipulation of convex polyhedra relies on the so-called double descri...
Nicolas Halbwachs, David Merchat, Laure Gonnord
ICASSP
2011
IEEE
14 years 10 months ago
New radix-based FHT algorithm for computing the discrete Hartley transform
In this paper, a new fast Hartley transform (FHT) algorithmradix-22 suitable for pipeline implementation of the discrete Hartley transform (DHT) is presented. The proposed algorit...
Monir Taha Hamood, Said Boussakta
ECCV
2004
Springer
16 years 8 months ago
Characterization of Human Faces under Illumination Variations Using Rank, Integrability, and Symmetry Constraints
Photometric stereo algorithms use a Lambertian reflectance model with a varying albedo field and involve the appearances of only one object. This paper extends photometric stereo a...
Shaohua Kevin Zhou, Rama Chellappa, David W. Jacob...