Sciweavers

2520 search results - page 411 / 504
» The complexity of approximating entropy
Sort
View
125
Voted
ICIP
1998
IEEE
15 years 8 months ago
Vector Set-Partitioning with Successive Refinement Voronoi Lattice VQ for Embedded Wavelet Image Coding
: While lattice vector quantization (LVQ) can solve the complexity problem of LBG based vector quantizers, and also yield very general codebooks, a single stage lattice VQ, when ap...
Debargha Mukherjee, Sanjit K. Mitra
112
Voted
COCO
1998
Springer
98views Algorithms» more  COCO 1998»
15 years 8 months ago
Probabilistic Martingales and BPTIME Classes
We define probabilistic martingales based on randomized approximation schemes, and show that the resulting notion of probabilistic measure has several desirable robustness propert...
Kenneth W. Regan, D. Sivakumar
3DIM
1997
IEEE
15 years 8 months ago
Multi-Resolution Geometric Fusion
Geometric fusion of multiple sets of overlapping surface measurements is an important problem for complete 3D object or environment modelling. Fusion based on a discrete implicit ...
Adrian Hilton, John Illingworth
FOCS
1997
IEEE
15 years 8 months ago
Beyond the Flow Decomposition Barrier
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our appro...
Andrew V. Goldberg, Satish Rao
KDD
1998
ACM
442views Data Mining» more  KDD 1998»
15 years 8 months ago
BAYDA: Software for Bayesian Classification and Feature Selection
BAYDA is a software package for flexible data analysis in predictive data mining tasks. The mathematical model underlying the program is based on a simple Bayesian network, the Na...
Petri Kontkanen, Petri Myllymäki, Tomi Siland...