447 search results - page 48 / 90 » Approximation Algorithms for the Discrete Time-Cost Tradeoff... |
135
Voted
CVPR
2003
IEEE
16 years 5 months ago
2003
IEEE
In many applications of graphical models arising in computer vision, the hidden variables of interest are most naturally specified by continuous, non-Gaussian distributions. There...
119
Voted
COMPGEOM
2009
ACM
15 years 10 months ago
2009
ACM
It was shown in [11] that any orientable graph of genus g can be probabilistically embedded into a graph of genus g − 1 with constant distortion. Removing handles one by one giv...
144
Voted
QEST
2010
IEEE
15 years 1 months ago
2010
IEEE
We introduce Fortuna, the first tool for model checking priced probabilistic timed automata (PPTAs). Fortuna can handle the combination of real-time, probabilistic and cost feature...
121
Voted
COMPGEOM
2006
ACM
15 years 9 months ago
2006
ACM
In this paper, we study the problem of L1-fitting a shape to a set of point, where the target is to minimize the sum of distances of the points to the shape, or alternatively the...
142
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
The Steiner tree problem is a classical NP-hard optimization problem with a wide range of practical applications. In an instance of this problem, we are given an undirected graph ...