Sciweavers

119 search results - page 3 / 24
» Two Structural Results for Low Degree Polynomials and Applic...
Sort
View
ICVGIP
2004
14 years 11 months ago
Geometric Structure Computation from Conics
This paper presents several results on images of various configurations of conics. We extract information about the plane from single and multiple views of known and unknown conic...
Pawan Kumar Mudigonda, C. V. Jawahar, P. J. Naraya...
CATS
2007
14 years 11 months ago
Some Structural and Geometric Properties of Two-Connected Steiner Networks
We consider the problem of constructing a shortest Euclidean 2-connected Steiner network (SMN) for a set of terminals. This problem has natural applications in the design of survi...
K. Hvam, L. Reinhardt, Pawel Winter, Martin Zachar...
ICISC
2000
126views Cryptology» more  ICISC 2000»
14 years 11 months ago
Cryptographic Applications of Sparse Polynomials over Finite Rings
Abstract. This paper gives new examples that exploit the idea of using sparse polynomials with restricted coefficients over a finite ring for designing fast, reliable cryptosystems...
William D. Banks, Daniel Lieman, Igor Shparlinski,...
STACS
2010
Springer
15 years 4 months ago
Efficient and Error-Correcting Data Structures for Membership and Polynomial Evaluation
We construct efficient data structures that are resilient against a constant fraction of adversarial noise. Our model requires that the decoder answers most queries correctly with...
Victor Chen, Elena Grigorescu, Ronald de Wolf
SPAA
2003
ACM
15 years 3 months ago
Novel architectures for P2P applications: the continuous-discrete approach
We propose a new approach for constructing P2P networks based on a dynamic decomposition of a continuous space into cells corresponding to servers. We demonstrate the power of thi...
Moni Naor, Udi Wieder