Sciweavers

9626 search results - page 1745 / 1926
» Invariant Based Programming
Sort
View
122
Voted
PAMI
2010
168views more  PAMI 2010»
15 years 1 months ago
Nonnegative Least-Correlated Component Analysis for Separation of Dependent Sources by Volume Maximization
—Although significant efforts have been made in developing nonnegative blind source separation techniques, accurate separation of positive yet dependent sources remains a challen...
Fa-Yu Wang, Chong-Yung Chi, Tsung-Han Chan, Yue Wa...
115
Voted
PSD
2010
Springer
109views Database» more  PSD 2010»
15 years 29 days ago
A Tool for Analyzing and Fixing Infeasible RCTA Instances
Minimum-distance controlled tabular adjustment methods (CTA), and its restricted variants (RCTA), is a recent perturbative approach for tabular data protection. Given a table to be...
Jordi Castro, José A. González
128
Voted
RAS
2010
117views more  RAS 2010»
15 years 29 days ago
Extending BDI plan selection to incorporate learning from experience
An important drawback to the popular Belief, Desire, and Intentions (BDI) paradigm is that such systems include no element of learning from experience. We describe a novel BDI exe...
Dhirendra Singh, Sebastian Sardiña, Lin Pad...
137
Voted
SAS
2010
Springer
149views Formal Methods» more  SAS 2010»
15 years 29 days ago
Boxes: A Symbolic Abstract Domain of Boxes
Symbolic Abstract Domain of Boxes Arie Gurfinkel and Sagar Chaki Carnegie Mellon University Abstract. Numeric abstract domains are widely used in program analyses. The simplest nu...
Arie Gurfinkel, Sagar Chaki
122
Voted
SIAMSC
2010
132views more  SIAMSC 2010»
15 years 29 days ago
New Algorithms for Optimal Online Checkpointing
Frequently, the computation of derivatives for optimizing time-dependent problems is based on the integration of the adjoint differential equation. For this purpose, the knowledge...
Philipp Stumm, Andrea Walther
« Prev « First page 1745 / 1926 Last » Next »