2520 search results - page 94 / 504 » The complexity of approximating entropy |
ICIP
2002
IEEE
15 years 12 months ago
2002
IEEE
We consider the estimation of an unknown arbitrary 2D object shape from sparse noisy samples of its Fourier transform. The estimate of the closed boundarycurve is parametrized by ...
67
Voted
PODS
2004
ACM
15 years 10 months ago
2004
ACM
The technique of k-anonymization has been proposed in the literature as an alternative way to release public information, while ensuring both data privacy and data integrity. We p...
98
Voted
GLOBECOM
2008
IEEE
15 years 4 months ago
2008
IEEE
— In this paper, we propose a low-complexity iterative joint channel estimation, detection and decoding technique for doubly selective channels. The key is a segment-by-segment f...
94
Voted
AAIM
2005
Springer
15 years 3 months ago
2005
Springer
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
89
Voted
ISVC
2005
Springer
15 years 3 months ago
2005
Springer
The Ambient Intelligence (AmI) paradigm requires a robust interpretation of people actions and behaviour and a way for automatically generating persistent spatial-temporal models o...