19 search results - page 3 / 4 » Discovering affine equalities using random interpretation |
KDD
2005
ACM
14 years 6 months ago
2005
ACM
While scalable data mining methods are expected to cope with massive Web data, coping with evolving trends in noisy data in a continuous fashion, and without any unnecessary stopp...
CIKM
2010
Springer
13 years 4 months ago
2010
Springer
We describe efficient techniques for construction of large term co-occurrence graphs, and investigate an application to the discovery of numerous fine-grained (specific) topics. A...
IJNSEC
2008
13 years 6 months ago
2008
In 1949, Shannon proved the perfect secrecy of the Vernam cryptographic system (One-Time Pad or OTP). It has generally been believed that the perfectly random and uncompressible O...
MIR
2010
ACM
13 years 11 months ago
2010
ACM
There is considerable research in the field of content-based medical image retrieval; however, few of the current systems investigate the relationship between the radiologists’...
TAP
2010
Springer
13 years 3 months ago
2010
Springer
Program verification systems based on automated theorem provers rely on user-provided axioms in order to verify domain-specific properties of code. However, formulating axioms corr...