Sciweavers

332 search results - page 23 / 67
» Specifying Complex and Structured Systems with Evolving Alge...
Sort
View
CADE
2007
Springer
14 years 7 months ago
Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
Viktor Kuncak, Martin C. Rinard
AUTOMATICA
2008
139views more  AUTOMATICA 2008»
13 years 7 months ago
Structured low-rank approximation and its applications
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
Ivan Markovsky
ICASSP
2009
IEEE
13 years 5 months ago
A PARAFAC-based technique for detection and localization of multiple targets in a MIMO radar system
In this paper, we show that the problem of detection and localization of multiple targets in a bistatic MIMO radar system can be solved by Parallel Factor (PARAFAC) analysis. Our ...
Dimitri Nion, Nicholas D. Sidiropoulos
UAI
1998
13 years 9 months ago
Tractable Inference for Complex Stochastic Processes
The monitoring and control of any dynamic system depends crucially on the ability to reason about its current status and its future trajectory. In the case of a stochastic system,...
Xavier Boyen, Daphne Koller
CORR
1998
Springer
105views Education» more  CORR 1998»
13 years 7 months ago
Solving Degenerate Sparse Polynomial Systems Faster
Abstract. Consider a system F of n polynomial equations in n unknowns, over an algebraically closed field of arbitrary characteristic. We present a fast method to find a point in...
J. Maurice Rojas