3874 search results - page 297 / 775 » Approximation Algorithms for k-hurdle Problems |
172
click to vote
QEST
2008
IEEE
15 years 11 months ago
2008
IEEE
We tackle the problem of non robustness of simulation and bisimulation when dealing with probabilistic processes. It is important to ignore tiny deviations in probabilities becaus...
136
Voted
FORMATS
2004
Springer
15 years 10 months ago
2004
Springer
We propose an effective and complete method for verifying safety and properties of timed systems, which is based on predicate abstraction for g finite abstractions of timed autom...
141
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
We have studied two efficient sampling methods, Langevin and Hessian adapted Metropolis Hastings (MH), applied to a parameter estimation problem of the mathematical model (Lorent...
184
click to vote
CORR
2012
Springer
14 years 17 days ago
2012
Springer
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
148
click to vote
WEA
2007
Springer
15 years 11 months ago
2007
Springer
Given a bipartite graph G = (L0, L1, E) and a fixed ordering of the nodes in L0, the problem of finding an ordering of the nodes in L1 that minimizes the number of crossings has ...