Sciweavers

2312 search results - page 266 / 463
» The complexity of estimating min-entropy
Sort
View
ICMCS
2007
IEEE
173views Multimedia» more  ICMCS 2007»
16 years 1 months ago
Tracking Multiple Objects using Probability Hypothesis Density Filter and Color Measurements
Most methods for multiple object tracking in video represent the state of multi-objects in a high dimensional joint state space. This leads to high computational complexity. This ...
Nam Trung Pham, Weimin Huang, Sim Heng Ong
SCALESPACE
2007
Springer
16 years 25 days ago
Best Basis Compressed Sensing
This paper proposes an extension of compressed sensing that allows to express the sparsity prior in a dictionary of bases. This enables the use of the random sampling strategy of c...
Gabriel Peyré
ICDE
2006
IEEE
125views Database» more  ICDE 2006»
16 years 23 days ago
Towards a Quality Model for Effective Data Selection in Collaboratories
Data-driven scientific applications utilize workflow frameworks to execute complex dataflows, resulting in derived data products of unknown quality. We discuss our on-going resear...
Yogesh Simmhan, Beth Plale, Dennis Gannon
IIHMSP
2006
IEEE
147views Multimedia» more  IIHMSP 2006»
16 years 23 days ago
Automatic Real-Time Moving Target Detection from Infrared Video
A novel progressive estimation scheme is proposed to detect moving targets in infrared video sequences in this work. The proposed algorithm does not place constraints on camera mo...
Shahryar Karimi-Ashtiani, C. C. Jay Kuo
COCOON
2005
Springer
16 years 8 days ago
Randomized Quicksort and the Entropy of the Random Source
Abstract. The worst-case complexity of an implementation of Quicksort depends on the random number generator that is used to select the pivot elements. In this paper we estimate th...
Beatrice List, Markus Maucher, Uwe Schöning, ...