Sciweavers

1245 search results - page 191 / 249
» Triangulation for Points on Lines
Sort
View
CCCG
1993
14 years 11 months ago
Widest-corridor Problems
A k-dense corridor through a finite set, S, of n points in the plane is the open region of the plane that is bounded by two parallel lines that intersect the convex hull of S and ...
Ravi Janardan, Franco P. Preparata
CGF
2010
147views more  CGF 2010»
14 years 9 months ago
Resampling Strategies for Deforming MLS Surfaces
Moving-Least-Squares (MLS) Surfaces undergoing large deformations need periodic regeneration of the point set (point-set resampling) so as to keep the point-set density quasi-unif...
Joao Paulo Gois, Gustavo C. Buscaglia
ALGORITHMICA
2006
149views more  ALGORITHMICA 2006»
14 years 9 months ago
Partial Lifting and the Elliptic Curve Discrete Logarithm Problem
It has been suggested that a major obstacle in finding an index calculus attack on the elliptic curve discrete logarithm problem lies in the difficulty of lifting points from ellip...
Qi Cheng, Ming-Deh A. Huang
IANDC
2006
103views more  IANDC 2006»
14 years 9 months ago
Bisimulation and cocongruence for probabilistic systems
We introduce a new notion of bisimulation, called event bisimulation on labelled Markov processes (LMPs) and compare it with the, now standard, notion of probabilistic bisimulatio...
Vincent Danos, Josee Desharnais, François L...
IJNSEC
2007
121views more  IJNSEC 2007»
14 years 9 months ago
Data Hiding in a Kind of PDF Texts for Secret Communication
In this paper, we present a novel steganographic technique for hiding data in a kind of PDF texts. We first point out the secret channels in a kind of PDF English texts, which ar...
Shangping Zhong, Xueqi Cheng, Tierui Chen