Sciweavers

414 search results - page 27 / 83
» On discrete norms of polynomials
Sort
View
ALGORITHMICA
2006
149views more  ALGORITHMICA 2006»
13 years 10 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
ADCM
2011
13 years 5 months ago
Approximation properties of the Generalized Finite Element Method
In this paper, we have obtained an approximation result in the Generalized Finite Element Method (GFEM) that reflects the global approximation property of the Partition of Unity ...
C. Anitescu, U. Banerjee
RTSS
2007
IEEE
14 years 4 months ago
Optimal Discrete Rate Adaptation for Distributed Real-Time Systems
Many distributed real-time systems face the challenge of dynamically maximizing system utility and meeting stringent resource constraints in response to fluctuations in system wo...
Yingming Chen, Chenyang Lu, Xenofon D. Koutsoukos
SETA
2004
Springer
122views Mathematics» more  SETA 2004»
14 years 3 months ago
New LFSR-Based Cryptosystems and the Trace Discrete Log Problem (Trace-DLP)
In order to reduce key sizes and bandwidth, cryptographic systems have been proposed using minimal polynomials to represent finite field elements. These systems are essentially e...
Kenneth J. Giuliani, Guang Gong
CCCG
2007
13 years 11 months ago
Generalized Watchman Route Problem with Discrete View Cost
In this paper, we introduce a generalized version of the Watchman Route Problem (WRP) where the objective is to plan a continuous closed route in a polygon (possibly with holes) a...
Pengpeng Wang, Ramesh Krishnamurti, Kamal Gupta