Sciweavers

5052 search results - page 36 / 1011
» On the Complexity of Ordered Colorings
Sort
View
CORR
2010
Springer
168views Education» more  CORR 2010»
13 years 8 months ago
Upper oriented chromatic number of undirected graphs and oriented colorings of product graphs
The oriented chromatic number of an oriented graph G is the minimum order of an oriented graph H such that G admits a homomorphism to H. The oriented chromatic number of an undire...
Eric Sopena
CVIU
2007
84views more  CVIU 2007»
13 years 8 months ago
Practical implementation of LMMSE demosaicing using luminance and chrominance spaces
Most digital color cameras sample only one color at each spatial location, using a single sensor coupled with a color filter array (CFA). An interpolation step called demosaicing...
Brice Chaix de Lavarène, David Alleysson, J...
ICIP
2003
IEEE
14 years 10 months ago
Quaternion matrix singular value decomposition and its applications for color image processing
In this paper, we first discuss the singular value decomposition (SVD) of a quaternion matrix and propose an algorithm to calculate the SVD of a quaternion matrix using its equiva...
Soo-Chang Pei, Ja-Han Chang, Jian-Jiun Ding
IPCV
2007
13 years 10 months ago
Tracking Multiple Sports Players for Mobile Display
- An architecture system and a method for tracking people are presented for sports applications. The system’s input is video data from static camera and the output is the real wo...
Andreas Aristidou, Paul Pangalos, Hamid Aghvami
ALGORITHMICA
2008
121views more  ALGORITHMICA 2008»
13 years 8 months ago
Space Efficient Algorithms for Ordered Tree Comparison
In this paper we present techniques to significantly improve the space complexity of several ordered tree comparison algorithms without sacrificing the corresponding time complexit...
Lusheng Wang, Kaizhong Zhang