Sciweavers

2028 search results - page 62 / 406
» Deriving Relation Keys from XML Keys
Sort
View
JCB
2002
70views more  JCB 2002»
15 years 3 months ago
Strong Feature Sets from Small Samples
For small samples, classi er design algorithms typically suffer from over tting. Given a set of features, a classi er must be designed and its error estimated. For small samples, ...
Seungchan Kim, Edward R. Dougherty, Junior Barrera...
KDD
2009
ACM
248views Data Mining» more  KDD 2009»
15 years 8 months ago
PSkip: estimating relevance ranking quality from web search clickthrough data
1 In this article, we report our efforts in mining the information encoded as clickthrough data in the server logs to evaluate and monitor the relevance ranking quality of a commer...
Kuansan Wang, Toby Walker, Zijian Zheng
ACSAC
2000
IEEE
15 years 8 months ago
Introducing Decryption Authority into PKI
It is well-known that CA plays the central role in PKI. In this paper we introduce a new component into PKI, DA (decryption authority), which decrypts important and sensitive mess...
Feng Bao
SAC
2003
ACM
15 years 9 months ago
Organizational Modeling in UML and XML in the Context of Workflow Systems
Workflow technology plays a key role as an enabler in E-Commerce applications, such as supply chains. Until recently the major share of the attention of workflow systems researche...
Wil M. P. van der Aalst, Akhil Kumar, H. M. W. (Er...
CCS
2008
ACM
15 years 6 months ago
HMAC is a randomness extractor and applications to TLS
In this paper, we study the security of a practical randomness extractor and its application in the tls standard. Randomness extraction is the first stage of key derivation functi...
Pierre-Alain Fouque, David Pointcheval, Séb...