Koji+Ishikawa+%28illustrator%29

 More results for "Koji+Ishik..." in  VIDEOS DOCUMENTS AUDIOS GROUPS STAGES/PROFILES ALL

• 

• Combinatorial lower bounds for Secret Sharing Schemes 1996
• In a perfect secret sharing scheme, it holds that log 2 j V i j H(S), where S denotes the secret and V i denotes the set of the share of user i. On the other hand, it is well known that log 2 j Sj ? H...
• Rating:        Views: (1006)     Pages: ()     Uploaded: 13-05-09
•  

• 

• Combinatorial lower bounds for Secret Sharing Schemes 1996
• In a perfect secret sharing scheme, it holds that log 2 j V i j H(S), where S denotes the secret and V i denotes the set of the share of user i. On the other hand, it is well known that log 2 j Sj ? H...
• Rating:        Views: (1003)     Pages: ()     Uploaded: 15-05-09
•  

• 

• Combinatorial lower bounds for Secret Sharing Schemes 1996
• In a perfect secret sharing scheme, it holds that log 2 j V i j H(S), where S denotes the secret and V i denotes the set of the share of user i. On the other hand, it is well known that log 2 j Sj ? H...
• Rating:        Views: (1007)     Pages: ()     Uploaded: 13-05-09
•  

• 

• Combinatorial lower bounds for Secret Sharing Schemes 1996
• In a perfect secret sharing scheme, it holds that log 2 j V i j H(S), where S denotes the secret and V i denotes the set of the share of user i. On the other hand, it is well known that log 2 j Sj ? H...
• Rating:        Views: (1004)     Pages: ()     Uploaded: 13-05-09
•  

• 

• Combinatorial lower bounds for Secret Sharing Schemes 1996
• In a perfect secret sharing scheme, it holds that log 2 j V i j H(S), where S denotes the secret and V i denotes the set of the share of user i. On the other hand, it is well known that log 2 j Sj ? H...
• Rating:        Views: (1006)     Pages: ()     Uploaded: 13-05-09
•  

• 

• Subspace Classifier in Reproducing Kernel Hilbert Space 1999
• To improve the performance of subspace classifier, it is effective to reduce the dimensionality of the intersections between subspaces. For this purpose, the feature space is mapped implicitly to a hi...
• Rating:        Views: (1006)     Pages: ()     Uploaded: 13-05-09
•  

• 

• Subspace Classifier in Reproducing Kernel Hilbert Space 1999
• To improve the performance of subspace classifier, it is effective to reduce the dimensionality of the intersections between subspaces. For this purpose, the feature space is mapped implicitly to a hi...
• Rating:        Views: (1008)     Pages: ()     Uploaded: 15-05-09
•  

• 

• Dynamically Variable Line-Size Cache Exploiting High On-Chip Memory Ba...
• This paper proposes a novel cache architecture suitable for merged DRAM/logic LSIs, which is called "dynamically variable line-size cache (D-VLS cache)". The D-VLS cache can optimize its line-size acc...
• Rating:        Views: (1006)     Pages: ()     Uploaded: 13-05-09
•