Sciweavers

4047 search results - page 85 / 810
» The Discrete Basis Problem
Sort
View
COMPGEOM
2004
ACM
14 years 3 months ago
Solution of Scott's problem on the number of directions determined by a point set in 3-space
Let P be a set of n points in Ê3 , not all in a common plane. We solve a problem of Scott (1970) by showing that the connecting lines of P assume at least 2n − 7 different dir...
János Pach, Rom Pinchasi, Micha Sharir
JCIT
2008
99views more  JCIT 2008»
13 years 10 months ago
Iterative Operator-Splitting Methods for Stiff Problems in Complex Applications
In this paper we deal with the Landau-LifshitzGilbert equation which describes dynamics of ferromagnetism. Based on the strong nonlinearities a stabilised discretisation method is...
Jürgen Geiser
EUROCRYPT
2011
Springer
13 years 1 months ago
Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
Abstract. NTRUEncrypt, proposed in 1996 by Hostein, Pipher and Silverman, is the fastest known lattice-based encryption scheme. Its moderate key-sizes, excellent asymptotic perfor...
Damien Stehlé, Ron Steinfeld
GECCO
2007
Springer
185views Optimization» more  GECCO 2007»
14 years 4 months ago
Enhanced forma analysis of permutation problems
Forma analysis provides an approach to formally derive domain specific operators based on domain-independent operator templates by manipulating a set of equivalence relations (i....
Tao Gong, Andrew Tuson
NIPS
2004
13 years 11 months ago
Discrete profile alignment via constrained information bottleneck
Amino acid profiles, which capture position-specific mutation probabilities, are a richer encoding of biological sequences than the individual sequences themselves. However, profi...
Sean O'Rourke, Gal Chechik, Robin Friedman, Eleaza...