Sciweavers

281 search results - page 18 / 57
» A Method for Invariant Generation for Polynomial Continuous ...
Sort
View
EOR
2007
102views more  EOR 2007»
13 years 7 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
PODS
2006
ACM
137views Database» more  PODS 2006»
14 years 7 months ago
Data exchange: computing cores in polynomial time
Data exchange deals with inserting data from one database into another database having a different schema. We study and solve a central computational problem of data exchange, nam...
Georg Gottlob, Alan Nash
NIPS
2007
13 years 9 months ago
A Constraint Generation Approach to Learning Stable Linear Dynamical Systems
Stability is a desirable characteristic for linear dynamical systems, but it is often ignored by algorithms that learn these systems from data. We propose a novel method for learn...
Sajid M. Siddiqi, Byron Boots, Geoffrey J. Gordon
ICCV
2011
IEEE
12 years 7 months ago
Optimal Estimation of Vanishing Points in a Manhattan World
In this paper, we present an analytical method for computing the globally optimal estimates of orthogonal vanishing points in a “Manhattan world” with a calibrated camera. We ...
Faraz Mirzaei, Stergios Roumeliotis
CORR
2011
Springer
160views Education» more  CORR 2011»
12 years 11 months ago
PHCpack in Macaulay2
The Macaulay2 package PHCpack.m2 provides an interface to some of the functionality of PHCpack, a general-purpose solver for polynomial systems by homotopy continuation. The main f...
Elizabeth Gross, Sonja Petrovic, Jan Verschelde