588 search results - page 90 / 118 » Computing the Dimension of Linear Subspaces |
FOCS
2006
IEEE
14 years 3 months ago
2006
IEEE
We prove an upper bound, tight up to a factor of 2, for the number of vertices of level at most in an arrangement of n halfspaces in Rd , for arbitrary n and d (in particular, the...
ALGORITHMICA
2007
13 years 10 months ago
2007
Abstract Many compiler optimization techniques depend on the ability to calculate the number of elements that satisfy certain conditions. If these conditions can be represented by ...
CIVR
2007
Springer
14 years 4 months ago
2007
Springer
Over the years, many Linear Discriminant Analysis (LDA) algorithms have been proposed for the study of high dimensional data in a large variety of problems. An intrinsic limitatio...
DAC
2008
ACM
14 years 11 months ago
2008
ACM
We present a domain-specific approach to representing datapaths for hardware implementations of linear signal transform algorithms. We extend the tensor structure for describing l...
CVPR
2010
IEEE
14 years 6 months ago
2010
IEEE
Graph cuts have proven useful for image segmentation and for volumetric reconstruction in multiple view stereo. However, solutions are biased: the cost function tends to favour ei...