Sciweavers

843 search results - page 58 / 169
» A Graph-cut Based Algorithm For Approximate Mrf Optimization
Sort
View
EMMCVPR
2005
Springer
15 years 7 months ago
Optimizing the Cauchy-Schwarz PDF Distance for Information Theoretic, Non-parametric Clustering
This paper addresses the problem of efficient information theoretic, non-parametric data clustering. We develop a procedure for adapting the cluster memberships of the data pattern...
Robert Jenssen, Deniz Erdogmus, Kenneth E. Hild II...
PCM
2004
Springer
144views Multimedia» more  PCM 2004»
15 years 6 months ago
Dynamic Programming Based Adaptation of Multimedia Contents in UMA
Content adaptation is an effective solution to support the quality of service for multimedia services over heterogeneous networks. This paper deals with the accuracy and the real-...
Truong Cong Thang, Yong Ju Jung, Yong Man Ro
CORR
2007
Springer
112views Education» more  CORR 2007»
15 years 1 months ago
On Optimum Power Allocation for the V-BLAST
—A unified analytical framework for optimum power allocation in the unordered V-BLAST algorithm and its comparative performance analysis are presented. Compact closed-form appro...
Victoria Kostina, Sergey Loyka
TIP
2002
116views more  TIP 2002»
15 years 1 months ago
Adaptive approximate nearest neighbor search for fractal image compression
Fractal image encoding is a computationally intensive method of compression due to its need to find the best match between image sub-blocks by repeatedly searching a large virtual...
Chong Sze Tong, Man Wong
TPDS
2008
120views more  TPDS 2008»
15 years 1 months ago
A New Storage Scheme for Approximate Location Queries in Object-Tracking Sensor Networks
Energy efficiency is one of the most critical issues in the design of wireless sensor networks. Observing that many sensor applications for object tracking can tolerate a certain d...
Jianliang Xu, Xueyan Tang, Wang-Chien Lee