4007 search results - page 51 / 802 » Computation with imprecise probabilities |
SAC
2006
ACM
14 years 2 months ago
2006
ACM
This paper explores the generation of candidates, which is an important step in frequent itemset mining algorithms, from a theoretical point of view. Important notions in our prob...
HPCC
2007
Springer
14 years 19 days ago
2007
Springer
Abstract. Energy consumption is a major factor that limits the performance of sensor applications. Sensor nodes have varying sampling rates since they face continuously changing en...
AMDO
2008
Springer
13 years 10 months ago
2008
Springer
The main focus of this paper is to present a method of reusing motion captured data by learning a generative model of motion. The model allows synthesis and blending of cyclic moti...
DCC
2011
IEEE
13 years 3 months ago
2011
IEEE
Abstract Many attacks on encryption schemes rely on statistical considerations using plaintext/ciphertext pairs to find some information on the key. We provide here simple formula...
ICPR
2008
IEEE
14 years 10 months ago
2008
IEEE
In kernel density estimation methods, an approximation of the data probability density function is achieved by locating a kernel function at each data location. The smoothness of ...