Sciweavers

849 search results - page 49 / 170
» Completely Non-malleable Schemes
Sort
View
ICCAD
2002
IEEE
117views Hardware» more  ICCAD 2002»
15 years 9 months ago
An enhanced multilevel routing system
In this paper, we present several novel techniques that make the recently published multilevel routing scheme [19] more effective and complete. Our contributions include: (1) reso...
Jason Cong, Min Xie, Yan Zhang
125
Voted
DOLAP
1998
ACM
15 years 4 months ago
Methodological Framework for Data Warehouse Design
Though designing a data warehouse requires techniques completely different from those adopted for operational systems, no significant effort has been made so far to develop a comp...
Matteo Golfarelli, Stefano Rizzi
87
Voted
CRYPTO
2006
Springer
108views Cryptology» more  CRYPTO 2006»
15 years 4 months ago
Inverting HFE Is Quasipolynomial
In the last ten years, multivariate cryptography has emerged as a possible alternative to public key cryptosystems based on hard computational problems from number theory. Notably,...
Louis Granboulan, Antoine Joux, Jacques Stern
IJCAI
2003
15 years 1 months ago
Understanding the Power of Clause Learning
Efficient implementations of DPLL with the addition of clause learning are the fastest complete satisfiability solvers and can handle many significant real-world problems, such as...
Paul Beame, Henry A. Kautz, Ashish Sabharwal
TSP
2010
14 years 7 months ago
Improving wireless physical layer security via cooperating relays
Physical (PHY) layer security approaches for wireless communications can prevent eavesdropping without upper layer data encryption. However, they are hampered by wireless channel c...
Lun Dong, Zhu Han, Athina P. Petropulu, H. Vincent...