Sciweavers

793 search results - page 30 / 159
» Efficient computation of the characteristic polynomial
Sort
View
ECAI
2010
Springer
13 years 5 months ago
Complexity of Axiom Pinpointing in the DL-Lite Family of Description Logics
We investigate the complexity of axiom pinpointing for different members of the DL-Lite family of Description Logics. More precisely, we consider the problem of enumerating all mi...
Rafael Peñaloza, Baris Sertkaya
DAC
2009
ACM
14 years 8 months ago
Provably good and practically efficient algorithms for CMP dummy fill
Abstract--To reduce chip-scale topography variation in Chemical Mechanical Polishing (CMP) process, dummy fill is widely used to improve the layout density uniformity. Previous res...
Chunyang Feng, Hai Zhou, Changhao Yan, Jun Tao, Xu...
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...
MCS
2008
Springer
13 years 7 months ago
On the stability analysis of nonlinear systems using polynomial Lyapunov functions
In the stability study of nonlinear systems, not to found feasible solution for the LMI problem associated with a quadratic Lyapunov function shows that it doesn't exist posi...
Hajer Bouzaouache, Naceur Benhadj Braiek
RSA
2010
89views more  RSA 2010»
13 years 6 months ago
Some remarks on Betti numbers of random polygon spaces
Polygon spaces like Mℓ = {(u1, · · · , un) ∈ S1 × · · · S1 ; n i=1 liui = 0}/SO(2) or they three dimensional analogues Nℓ play an important rle in geometry and topolo...
Clément Dombry, Christian Mazza