Sciweavers

2520 search results - page 381 / 504
» The complexity of approximating entropy
Sort
View
ICIP
2006
IEEE
16 years 6 months ago
Using Non-Parametric Kernel to Segment and Smooth Images Simultaneously
Piecewise constant and piecewise smooth Mumford-Shah (MS) models have been widely studied and used for image segmentation. More complicated than piecewise constant MS, global Gaus...
Weihong Guo, Yunmei Chen
ICIP
2005
IEEE
16 years 6 months ago
Visual tracking via efficient kernel discriminant subspace learning
Robustly tracking moving objects in video sequences is one of the key problems in computer vision. In this paper we introduce a computationally efficient nonlinear kernel learning...
Chunhua Shen, Anton van den Hengel, Michael J. Bro...
ICIP
2001
IEEE
16 years 6 months ago
Joint source-channel coding for scalable video over DS-CDMA multipath fading channels
In this paper, we extend our previous work onjoint source-channel coding to scalablevideo transmissionover wireless direct-sequence code-division-multiple-access(DS-CDMA)multipath...
Lisimachos P. Kondi, Stella N. Batalama, Dimitrios...
ICDE
2005
IEEE
136views Database» more  ICDE 2005»
16 years 5 months ago
Bloom Filter-based XML Packets Filtering for Millions of Path Queries
The filtering of XML data is the basis of many complex applications. Lots of algorithms have been proposed to solve this problem[2, 3, 5, 6, 7, 8, 9, 11, 12, 13, 18]. One importan...
Xueqing Gong, Ying Yan, Weining Qian, Aoying Zhou
ICDE
2005
IEEE
108views Database» more  ICDE 2005»
16 years 5 months ago
Range Efficient Computation of F0 over Massive Data Streams
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...
Pavan Aduri, Srikanta Tirthapura