Sciweavers

63 search results - page 4 / 13
» Subspace Codes
Sort
View
DM
2007
74views more  DM 2007»
13 years 7 months ago
Parameters for which the Griesmer bound is not sharp
7 We prove for a large class of parameters t and r that a multiset of at most t d−k + r d−k−2 points in PG(d, q) that blocks every k-dimensional subspace at least t times mu...
Andreas Klein, Klaus Metsch
TKDE
2008
127views more  TKDE 2008»
13 years 7 months ago
Maximal Subspace Coregulated Gene Clustering
Clustering is a popular technique for analyzing microarray data sets, with n genes and m experimental conditions. As explored by biologists, there is a real need to identify coregu...
Yuhai Zhao, Jeffrey Xu Yu, Guoren Wang, Lei Chen 0...
ICPR
2008
IEEE
14 years 8 months ago
Parametric video compression using appearance space
The novelty of the approach presented in this paper is the unique object-based video coding framework for videos obtained from a static camera. As opposed to most existing methods...
Santanu Chaudhury, Subarna Tripathi, Sumantra Dutt...
STOC
2012
ACM
185views Algorithms» more  STOC 2012»
11 years 9 months ago
Subspace evasive sets
In this work we describe an explicit, simple, construction of large subsets of Fn , where F is a finite field, that have small intersection with every k-dimensional affine subsp...
Zeev Dvir, Shachar Lovett
ICIP
1995
IEEE
13 years 11 months ago
Novel fast block motion estimation in feature subspace
Motion estimation and compensation are widely used in video coding. This paper presents two fast block matching algorithms for motion estimation. These algorithms use the subspace...
Yiu-Hung Fok, Oscar C. Au, Ross D. Murch