Sciweavers

1523 search results - page 59 / 305
» The Computational Complexity of Linear Optics
Sort
View
IPPS
2003
IEEE
14 years 2 months ago
Remote Model Reduction of Very Large Linear Systems
We describe a prototype Web service for model reduction of very large-scale linear systems. Specifically, a userfriendly interface is designed so that model reduction can be easi...
Peter Benner, Rafael Mayo, Enrique S. Quintana-Ort...
CVPR
2005
IEEE
14 years 11 months ago
Modeling and Learning Contact Dynamics in Human Motion
We propose a simple model of human motion as a switching linear dynamical system where the switches correspond to contact forces with the ground. This significantly improves the m...
Alessandro Bissacco
CDC
2009
IEEE
14 years 1 months ago
Schur-based decomposition for reachability analysis of linear time-invariant systems
— We present a method for complexity reduction in reachability analysis and controller synthesis via a Schur-based decomposition for LTI systems. The decomposition yields either ...
Shahab Kaynama, Meeko Oishi
ESOP
2007
Springer
14 years 3 months ago
Computing Procedure Summaries for Interprocedural Analysis
Abstract. We describe a new technique for computing procedure summaries for performing an interprocedural analysis on programs. Procedure summaries are computed by performing a bac...
Sumit Gulwani, Ashish Tiwari
CVPR
2009
IEEE
1976views Computer Vision» more  CVPR 2009»
15 years 4 months ago
Linear Spatial Pyramid Matching Using Sparse Coding for Image Classification
Recently SVMs using spatial pyramid matching (SPM) kernel have been highly successful in image classification. Despite its popularity, these nonlinear SVMs have a complexity O(n...
Jianchao Yang, Kai Yu, Yihong Gong, Thomas S. Huan...