Sciweavers

727 search results - page 15 / 146
» One line and n points
Sort
View
IACR
2011
91views more  IACR 2011»
14 years 5 months ago
A Scalable Method for Constructing Galois NLFSRs with Period $2^n-1$ using Cross-Join Pairs
This paper presents a method for constructing n-stage Galois NLFSRs with period 2n − 1 from n-stage maximum length LFSRs. We introduce nonlinearity into state cycles by adding a ...
Elena Dubrova
CCCG
2009
15 years 7 months ago
Generalized jewels and the point placement problem
The point placement problem is to determine the positions of a linear set of points, P = {p1, p2, p3, . . . , pn}, uniquely, up to translation and reflection, from the fewest poss...
Md. Shafiul Alam, Asish Mukhopadhyay, Animesh Sark...
CORR
2011
Springer
157views Education» more  CORR 2011»
14 years 9 months ago
Convex Hull of Imprecise Points in o(n \log{n}) Time after Preprocessing
Motivated by the desire to cope with data imprecision [8], we study methods for preprocessing a set of planar regions such that whenever we are given a set of points, each of whic...
Esther Ezra, Wolfgang Mulzer
DCG
2008
86views more  DCG 2008»
15 years 6 months ago
Efficient Algorithms for Maximum Regression Depth
We investigate algorithmic questions that arise in the statistical problem of computing lines or hyperplanes of maximum regression depth among a set of n points. We work primarily...
Marc J. van Kreveld, Joseph S. B. Mitchell, Peter ...
COMPGEOM
2011
ACM
14 years 9 months ago
Three problems about dynamic convex hulls
We present three results related to dynamic convex hulls: • A fully dynamic data structure for maintaining a set of n points in the plane so that we can find the edges of the c...
Timothy M. Chan