Sciweavers

1618 search results - page 178 / 324
» Testing random number generators
Sort
View
SCIENTOMETRICS
2010
141views more  SCIENTOMETRICS 2010»
13 years 5 months ago
Acceleration of citing behavior after the millennium? Exemplary bibliometric reference analyses for psychology journals
With reference to social constructivist approaches on citing behavior in the sciences, the hypothesis of acceleration of citing behavior after the millennium was empirically tested...
Günter Krampen
SIGIR
2008
ACM
13 years 10 months ago
A unified and discriminative model for query refinement
This paper addresses the issue of query refinement, which involves reformulating ill-formed search queries in order to enhance relevance of search results. Query refinement typica...
Jiafeng Guo, Gu Xu, Hang Li, Xueqi Cheng
DATE
2000
IEEE
87views Hardware» more  DATE 2000»
14 years 2 months ago
Multi-Node Static Logic Implications for Redundancy Identification
This paper presents a method for redundancy identification (RID) using multi-node logic implications. The algorithm discovers a large number of direct and indirect implications b...
Kabir Gulrajani, Michael S. Hsiao
INFOCOM
2003
IEEE
14 years 3 months ago
Static and Dynamic Analysis of the Internet's Susceptibility to Faults and Attacks
— We analyze the susceptibility of the Internet to random faults, malicious attacks, and mixtures of faults and attacks. We analyze actual Internet data, as well as simulated dat...
Seung-Taek Park, Alexy Khrabrov, David M. Pennock,...
TIT
2008
164views more  TIT 2008»
13 years 10 months ago
Cryptographic Hardness Based on the Decoding of Reed-Solomon Codes
We investigate the decoding problem of Reed-Solomon (RS) Codes, also known as the Polynomial Reconstruction Problem (PR), from a cryptographic hardness perspective. Namely, we dea...
Aggelos Kiayias, Moti Yung