Sciweavers

2520 search results - page 25 / 504
» The complexity of approximating entropy
Sort
View
ICIP
2007
IEEE
14 years 4 months ago
Outer-Layer Based Tracking using Entropy as a Similarity Measure
Tracking can be achieved using region active contours based on homogeneity models (intensity, motion...). However the model complexity necessary to achieve a given accuracy might ...
Vincent Garcia, Sylvain Boltz, Eric Debreuve, Mich...
ICPR
2008
IEEE
14 years 4 months ago
Birkhoff polytopes, heat kernels and graph complexity
In this paper we use doubly stochastic matrices to establish a link between Birkhoff polytopes and heat kernels on graphs. Based on this analysis we construct a multi-dimensional ...
Francisco Escolano, Edwin R. Hancock, Miguel Angel...
FCT
2003
Springer
14 years 2 months ago
Complexity of Approximating Closest Substring Problems
The closest substring problem, where a short string is sought that minimizes the number of mismatches between it and each of a given set of strings, is a minimization problem with ...
Patricia A. Evans, Andrew D. Smith
IPL
2006
99views more  IPL 2006»
13 years 9 months ago
Computational complexity of queries based on itemsets
We investigate determining the exact bounds of the frequencies of conjunctions based on frequent sets. Our scenario is an important special case of some general probabilistic logi...
Nikolaj Tatti
ICIP
2008
IEEE
14 years 11 months ago
Motion estimation with entropy coding considerations in H.264/AVC
In many modern video encoders, motion estimation is usually formulated as a Lagrangian cost function that balances motion prediction accuracy and the rate to transmit motion vecto...
Zhen Li, Alexis Michael Tourapis