2520 search results - page 58 / 504 » The complexity of approximating entropy |
ICDM
2007
IEEE
15 years 1 months ago
2007
IEEE
Data discretization is defined as a process of converting continuous data attribute values into a finite set of intervals with minimal loss of information. In this paper, we prove...
ISIPTA
2003
IEEE
15 years 3 months ago
2003
IEEE
Walley’s Imprecise Dirichlet Model (IDM) for categorical data overcomes several fundamental problems which other approaches to uncertainty suffer from. Yet, to be useful in prac...
VMV
2004
14 years 11 months ago
2004
The compression of polygonal mesh geometry is still an active field of research as in 3d no theoretical bounds are known. This work proposes a geometry coding method based on pred...
COCO
2005
Springer
15 years 3 months ago
2005
Springer
We study the complexity of solving succinct zero-sum games, i.e., the games whose payoff matrix M is given implicitly by a Boolean circuit C such that M(i, j) = C(i, j). We comple...
WDAG
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. In this paper, we present fast and fully distributed algorithms for matching in weighted trees and general weighted graphs. The time complexity as well as the approximati...