628 search results - page 32 / 126 » Magic Counting Methods |
VIS
2009
IEEE
14 years 9 months ago
2009
IEEE
Many techniques have been proposed to show uncertainty in data visualizations. However, very little is known about their effectiveness in conveying meaningful information. In this ...
DEXA
2005
Springer
14 years 1 months ago
2005
Springer
The main challenge of mining sequential patterns is the high processing cost of support counting for large amount of candidate patterns. For solving this problem, SPAM algorithm wa...
ECIR
2007
Springer
13 years 9 months ago
2007
Springer
Abstract. We propose a popularity weighted ranking algorithm for academic digital libraries that uses the popularity factor of a publication venue overcoming the limitations of imp...
NIPS
2004
13 years 9 months ago
2004
We present a semi-parametric latent variable model based technique for density modelling, dimensionality reduction and visualization. Unlike previous methods, we estimate the late...
WCET
2003
13 years 9 months ago
2003
Worst-Case Execution Time (WCET) analysis means to compute a safe upper bound to the execution time of a piece of code. Parametric WCET analysis yields symbolic upper bounds: expr...