Sciweavers

534 search results - page 23 / 107
» Efficient polynomial L-approximations
Sort
View
TCS
2008
13 years 7 months ago
On the complexity of real root isolation using continued fractions
We present algorithmic, complexity and implementation results concerning real root isolation of integer univariate polynomials using the continued fraction expansion of real algeb...
Elias P. Tsigaridas, Ioannis Z. Emiris
CDB
2004
Springer
158views Database» more  CDB 2004»
13 years 11 months ago
Constraint Databases, Data Structures and Efficient Query Evaluation
Abstract. Constraint databases that can be described by boolean combinations of polynomial inequalities over the reals have received ample research attention. In particular, the ex...
Joos Heintz, Bart Kuijpers
ICISC
2004
96views Cryptology» more  ICISC 2004»
13 years 9 months ago
Efficient Broadcast Encryption Using Multiple Interpolation Methods
We propose a new broadcast encryption scheme based on polynomial interpolations. Our scheme, obtained from the Naor-Pinkas scheme by partitioning the user set and interpolating mul...
Eun Sun Yoo, Nam-Su Jho, Jung Hee Cheon, Myung-Hwa...
TWC
2008
143views more  TWC 2008»
13 years 7 months ago
Broadcasting energy efficiency limits in wireless networks
Broadcasting allows efficient information sharing and fusion in wireless networks. In this paper, the energy efficiency limits in wireless broadcasting, defined as the minimal achi...
Liang Song, Dimitrios Hatzinakos
DSN
2006
IEEE
13 years 11 months ago
Efficient High Hamming Distance CRCs for Embedded Networks
Cyclic redundancy codes (CRCs) are widely used in network transmission and data storage applications because they provide better error detection than lighter weight checksum techn...
Justin Ray, Philip Koopman