Sciweavers

3625 search results - page 220 / 725
» On choosing
Sort
View
FUIN
2008
76views more  FUIN 2008»
15 years 7 months ago
Prescribed Learning of Indexed Families
Abstract. This work extends studies of Angluin, Lange and Zeugmann on how learnability of a language class depends on the hypothesis space used by the learner. While previous studi...
Sanjay Jain, Frank Stephan, Nan Ye
CACM
2006
95views more  CACM 2006»
15 years 7 months ago
Computational thinking
ional thinking is using abstraction and decomposition when attacking a large complex task or designing a large complex system. It is separation of concerns. It is choosing an appro...
Jeannette M. Wing
IEICET
2008
147views more  IEICET 2008»
15 years 7 months ago
Computing the Ate Pairing on Elliptic Curves with Embedding Degree k = 9
For AES 128 security level there are several natural choices for pairing-friendly elliptic curves. In particular, as we will explain, one might choose curves with k = 9 or curves w...
Xibin Lin, Changan Zhao, Fangguo Zhang, Yanming Wa...
CG
2006
Springer
15 years 7 months ago
A smooth, obstacle-avoiding curve
An algorithm for finding a smooth, obstacle-avoiding curve in the plane can be quite complicated. The process usually involves finding one or more feasible polyline paths, choosin...
Zhong Li, Dereck S. Meek, Desmond J. Walton
DSS
2006
91views more  DSS 2006»
15 years 7 months ago
Matching information security vulnerabilities to organizational security profiles: a genetic algorithm approach
Organizations are making substantial investments in information security to reduce the risk presented by vulnerabilities in their information technology (IT) infrastructure. Howev...
Mukul Gupta, Jackie Rees, Alok R. Chaturvedi, Jie ...