588 search results - page 58 / 118 » Computing the Dimension of Linear Subspaces |
105
Voted
DAC
2009
ACM
15 years 10 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...
149
Voted
CVPR
2007
IEEE
16 years 5 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...
139
Voted
FPL
2006
Springer
15 years 7 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...
141
Voted
FOCS
2002
IEEE
15 years 8 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 ...
191
Voted
VLSISP
2010
15 years 2 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...