Sciweavers

1688 search results - page 105 / 338
» The Complexity of Rationalizing Matchings
Sort
View
PKC
1999
Springer
115views Cryptology» more  PKC 1999»
15 years 10 months ago
Decision Oracles are Equivalent to Matching Oracles
One of the key directions in complexity theory which has also filtered through to cryptographic research, is the effort to classify related but seemingly distinct notions. Separa...
Helena Handschuh, Yiannis Tsiounis, Moti Yung
DATE
2004
IEEE
119views Hardware» more  DATE 2004»
15 years 9 months ago
MINCE: Matching INstructions Using Combinational Equivalence for Extensible Processor
Designing custom-extensible instructions for Extensible Processors1 is a computationally complex task because of the large design space. The task of automatically matching candida...
Newton Cheung, Sri Parameswaran, Jörg Henkel,...
175
Voted
ACCV
2009
Springer
15 years 9 months ago
People Tracking and Segmentation Using Efficient Shape Sequences Matching
Abstract. We design an effective shape prior embedded human silhouettes extraction algorithm. Human silhouette extraction is found challenging because of articulated structures, po...
Junqiu Wang, Yasushi Yagi, Yasushi Makihara
CCS
2010
ACM
16 years 16 days ago
Cryptographic role-based security mechanisms based on role-key hierarchy
Even though role-based access control (RBAC) can tremendously help us minimize the complexity in administering users, it is still needed to realize the notion of roles at the reso...
Yan Zhu, Gail-Joon Ahn, Hongxin Hu, Huaixi Wang
FSTTCS
2009
Springer
16 years 8 days ago
Arithmetic Circuits and the Hadamard Product of Polynomials
Motivated by the Hadamard product of matrices we define the Hadamard product of multivariate polynomials and study its arithmetic circuit and branching program complexity. We also...
Vikraman Arvind, Pushkar S. Joglekar, Srikanth Sri...