952 search results - page 170 / 191 » Computational complexity of stochastic programming problems |
115
click to vote
ISSAC
2007
Springer
15 years 8 months ago
2007
Springer
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
142
Voted
CORR
2012
Springer
13 years 10 months ago
2012
Springer
All previous work on “candidate-control” manipulation of elections has been in the model of full-information, simultaneous voting. This is a problem, since in quite a few real...
226
Voted
CVPR
2012
IEEE
13 years 4 months ago
2012
IEEE
A large number of problems in computer vision can be modeled as energy minimization problems in a markov random field (MRF) framework. Many methods have been developed over the y...
117
click to vote
EGH
2004
Springer
15 years 8 months ago
2004
Springer
Real-time graphics hardware continues to offer improved resources for programmable vertex and fragment shaders. However, shader programmers continue to write shaders that require ...
110
Voted
ICALP
2003
Springer
15 years 7 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...