2027 search results - page 109 / 406 » When is it best to best-respond |
130
click to vote
CORR
2010
Springer
15 years 27 days ago
2010
Springer
A general framework for solving image inverse problems is introduced in this paper. The approach is based on Gaussian mixture models, estimated via a computationally efficient MAP...
102
Voted
CONSTRAINTS
2008
15 years 27 days ago
2008
When solving systems of nonlinear equations with interval constraint methods, it has often been observed that many calls to contracting operators do not participate actively to th...
87
Voted
CORR
2010
Springer
15 years 27 days ago
2010
Springer
Given a graph G, an identifying code D V (G) is a vertex set such that for any two distinct vertices v1, v2 V (G), the sets N[v1] D and N[v2] D are distinct and nonempty (here...
CORR
2008
Springer
15 years 27 days ago
2008
Springer
We obtain a lower bound of n 1 k+1 22k (k-1)2k-1 on the k-party randomized communication complexity of the Disjointness function in the `Number on the Forehead' model of mul...
EC
2008
15 years 27 days ago
2008
We present a statistical model of empirical optimization that admits the creation of algorithms with explicit and intuitively defined desiderata. Because No Free Lunch theorems di...