Sciweavers

549 search results - page 78 / 110
» The corner arc algorithm
Sort
View
UAI
2008
15 years 16 days ago
Refractor Importance Sampling
In this paper we introduce Refractor Importance Sampling (RIS), an improvement to reduce error variance in Bayesian network importance sampling propagation under evidential reason...
Haohai Yu, Robert van Engelen
CORR
2010
Springer
103views Education» more  CORR 2010»
14 years 11 months ago
Probabilistic regular graphs
Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extensio...
Nathalie Bertrand, Christophe Morvan
NETWORKS
2008
14 years 11 months ago
Reformulation and sampling to solve a stochastic network interdiction problem
The Network Interdiction Problem involves interrupting an adversary's ability to maximize flow through a capacitated network by destroying portions of the network. A budget c...
Udom Janjarassuk, Jeff Linderoth
SIAMIS
2008
124views more  SIAMIS 2008»
14 years 11 months ago
Area Distances of Convex Plane Curves and Improper Affine Spheres
The area distance to a convex plane curve is an important concept in computer vision. In this paper we describe a strong link between area distances and improper affine spheres. Th...
Marcos Craizer, Moacyr Alvim, Ralph Teixeira
100
Voted
ATMOS
2010
308views Optimization» more  ATMOS 2010»
14 years 10 months ago
The Team Orienteering Problem: Formulations and Branch-Cut and Price
The Team Orienteering Problem is a routing problem on a graph with durations associated to the arcs and profits assigned to visiting the vertices. A fixed number of identical ve...
Marcus Poggi de Aragão, Henrique Viana, Edu...