Sciweavers

3177 search results - page 5 / 636
» Can We Have Confidence in a Tree Representation
Sort
View
TAMODIA
2004
13 years 9 months ago
Applying information visualization techniques to visual representations of task models
This paper shows how information visualization techniques can be used to improve the effectiveness of task model representations. In particular, we discuss how fisheye and semanti...
Fabio Paternò, Enrico Zini
MCS
2005
Springer
14 years 1 months ago
Ensemble Confidence Estimates Posterior Probability
We have previously introduced the Learn++ algorithm that provides surprisingly promising performance for incremental learning as well as data fusion applications. In this contribut...
Michael Muhlbaier, Apostolos Topalis, Robi Polikar
GECCO
2007
Springer
256views Optimization» more  GECCO 2007»
14 years 1 months ago
A particle swarm optimization approach for estimating parameter confidence regions
Point estimates of the parameters in real world models convey valuable information about the actual system. However, parameter comparisons and/or statistical inference requires de...
Praveen Koduru, Stephen Welch, Sanjoy Das
SODA
2010
ACM
200views Algorithms» more  SODA 2010»
14 years 5 months ago
Fully-Functional Succinct Trees
We propose new succinct representations of ordinal trees, which have been studied extensively. It is known that any n-node static tree can be represented in 2n + o(n) bits and a l...
Kunihiko Sadakane, Gonzalo Navarro
WG
2005
Springer
14 years 1 months ago
Algebraic Operations on PQ Trees and Modular Decomposition Trees
Partitive set families are families of sets that can be quite large, but have a compact, recursive representation in the form of a tree. This tree is a common generalization of PQ...
Ross M. McConnell, Fabien de Montgolfier