588 search results - page 58 / 118 » Computing the Dimension of Linear Subspaces |
DAC
2009
ACM
14 years 4 months ago
2009
ACM
This paper describes an automatic methodology for optimizing sample point selection for using in the framework of model order reduction (MOR). The procedure, based on the maximiza...
CVPR
2007
IEEE
14 years 12 months ago
2007
IEEE
In this paper, we propose a human action recognition system suitable for embedded computer vision applications in security systems, human-computer interaction and intelligent envi...
FPL
2006
Springer
14 years 1 months ago
2006
Springer
Many compute-intensive applications generate single result values by accessing clusters of nearby points in grids of one, two, or more dimensions. Often, the performance of FGPA i...
FOCS
2002
IEEE
14 years 2 months ago
2002
IEEE
Two decades ago, Megiddo and Dyer showed that linear programming in two and three dimensions (and subsequently any constant number of dimensions) can be solved in linear time. In ...
VLSISP
2010
13 years 8 months ago
2010
Abstract In case of insufficient data samples in highdimensional classification problems, sparse scatters of samples tend to have many ‘holes’—regions that have few or no nea...