Sciweavers

2944 search results - page 199 / 589
» Improving Bound Propagation
Sort
View
ECCV
2008
Springer
16 years 4 months ago
Toward Global Minimum through Combined Local Minima
There are many local and greedy algorithms for energy minimization over Markov Random Field (MRF) such as iterated condition mode (ICM) and various gradient descent methods. Local ...
Ho Yub Jung, Kyoung Mu Lee, Sang Uk Lee
IEEEARES
2009
IEEE
16 years 1 months ago
Capturing Information Flow with Concatenated Dynamic Taint Analysis
Dynamic taint analysis (DTA) is a technique used for tracking information flow by propagating taint propagation across memory locations during program execution. Most implementat...
Hyung Chan Kim, Angelos D. Keromytis, Michael Covi...
CORR
2008
Springer
103views Education» more  CORR 2008»
15 years 6 months ago
Quickest Change Detection of a Markov Process Across a Sensor Array
Recent attention in quickest change detection in the multi-sensor setting has been on the case where the densities of the observations change at the same instant at all the sensor...
Vasanthan Raghavan, Venugopal V. Veeravalli
AI
1998
Springer
15 years 6 months ago
Reasoning About Actions: Steady Versus Stabilizing State Constraints
In formal approaches to commonsense reasoning about actions. the Ramification Problem denotes the problem of handling indirect effects which implicitly derive from so-called state...
Michael Thielscher
CP
2010
Springer
15 years 5 months ago
A Box-Consistency Contractor Based on Extremal Functions
Abstract. Interval-based methods can approximate all the real solutions of a system of equations and inequalities. The Box interval constraint propagation algorithm enforces Box co...
Gilles Trombettoni, Yves Papegay, Gilles Chabert, ...