Sciweavers

5 search results - page 1 / 1
» Short XORs for Model Counting: From Theory to Practice
Sort
View
SAT
2007
Springer
81views Hardware» more  SAT 2007»
13 years 11 months ago
Short XORs for Model Counting: From Theory to Practice
Abstract. A promising approach for model counting was recently introduced, which in theory requires the use of large random xor or parity constraints to obtain near-exact counts of...
Carla P. Gomes, Jörg Hoffmann, Ashish Sabharw...
ICDT
2009
ACM
147views Database» more  ICDT 2009»
14 years 5 months ago
The average-case complexity of counting distinct elements
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
David P. Woodruff
KDD
2012
ACM
222views Data Mining» more  KDD 2012»
11 years 7 months ago
Rise and fall patterns of information diffusion: model and implications
The recent explosion in the adoption of search engines and new media such as blogs and Twitter have facilitated faster propagation of news and rumors. How quickly does a piece of ...
Yasuko Matsubara, Yasushi Sakurai, B. Aditya Praka...
BIRTHDAY
2009
Springer
13 years 11 months ago
Is the World Linear?
Super-resolution is the art of creating nice high-resolution raster images from given low-resolution raster images. Since “nice” is not a well-defined term in mathematics and ...
Rudolf Fleischer
ASIACRYPT
2000
Springer
13 years 9 months ago
Unconditionally Secure Digital Signature Schemes Admitting Transferability
A potentially serious problem with current digital signature schemes is that their underlying hard problems from number theory may be solved by an innovative technique or a new gen...
Goichiro Hanaoka, Junji Shikata, Yuliang Zheng, Hi...