Sciweavers

86 search results - page 13 / 18
» A 3-Dimensional Lattice Reduction Algorithm
Sort
View
STOC
1999
ACM
176views Algorithms» more  STOC 1999»
14 years 1 days 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
BMVC
2010
13 years 5 months ago
Iterative Hyperplane Merging: A Framework for Manifold Learning
We present a framework for the reduction of dimensionality of a data set via manifold learning. Using the building blocks of local hyperplanes we show how a global manifold can be...
Harry Strange, Reyer Zwiggelaar
COMPGEOM
2001
ACM
13 years 11 months ago
The convex hull of ellipsoids
The treatment of curved algebraic surfaces becomes more and more the focus of attention in Computational Geometry. We present a video that illustrates the computation of the conve...
Nicola Geismann, Michael Hemmer, Elmar Schöme...
ASIACRYPT
2004
Springer
14 years 1 months ago
Lattice-Based Threshold-Changeability for Standard Shamir Secret-Sharing Schemes
Abstract. We consider the problem of increasing the threshold parameter of a secret-sharing scheme after the setup (share distribution) phase, without further communication between...
Ron Steinfeld, Huaxiong Wang, Josef Pieprzyk
SECON
2008
IEEE
14 years 2 months ago
The Impact of Using Multiple Antennas on Wireless Localization
Abstract—We show that signal strength variability can be reduced by employing multiple low-cost antennas at fixed locations. We further explore the impact of this reduction on w...
Konstantinos Kleisouris, Yingying Chen, Jie Yang, ...