Sciweavers

64 search results - page 11 / 13
» Computations with quasiseparable polynomials and matrices
Sort
View
EOR
2007
102views more  EOR 2007»
14 years 9 months ago
Sub-stochastic matrix analysis for bounds computation - Theoretical results
Performance evaluation of complex systems is a critical issue and bounds computation provides confidence about service quality, reliability, etc. of such systems. The stochastic ...
Serge Haddad, Patrice Moreaux
FLOPS
2004
Springer
15 years 2 months ago
A Brief Survey of Quantum Programming Languages
Abstract. This article is a brief and subjective survey of quantum programming language research. 1 Quantum Computation Quantum computing is a relatively young subject. It has its ...
Peter Selinger
IJCV
2006
132views more  IJCV 2006»
14 years 9 months ago
Two-View Multibody Structure from Motion
We present an algebraic geometric approach to 3-D motion estimation and segmentation of multiple rigid-body motions from noise-free point correspondences in two perspective views. ...
René Vidal, Yi Ma, Stefano Soatto, Shankar ...
MFCS
2010
Springer
14 years 7 months ago
Weights of Exact Threshold Functions
We consider Boolean exact threshold functions defined by linear equations, and in general degree d polynomials. We give upper and lower bounds on the maximum magnitude (absolute va...
László Babai, Kristoffer Arnsfelt Ha...
ICRA
1999
IEEE
186views Robotics» more  ICRA 1999»
15 years 1 months ago
Grasp Analysis as Linear Matrix Inequality Problems
Three fundamental problems in the study of grasping and dextrous manipulation with multifingered robotic hands are as follows. a) Given a robotic hand and a grasp characterized by ...
Li Han, Jeffrey C. Trinkle, Zexiang Li