197 search results - page 14 / 40 » A Parallel Algorithm for Solving Large Convex Minimax Proble... |
PPL
2006
13 years 7 months ago
2006
A new computational paradigm is described which o ers the possibility of superlinear and sometimes unbounded speedup, when parallel computation is used. The computations involved ...
ICCV
2009
IEEE
15 years 16 days ago
2009
IEEE
The concept of graph cuts is by now a standard method
for all sorts of low level vision problems. Its popularity is
largely due to the fact that globally or near globally optimal...
AAAI
1992
13 years 8 months ago
1992
Constraint networks have been shown to be useful in formulating such diverse problems as scene labeling, natural language parsing, and temporal reasoning. Given a constraint netwo...
CCGRID
2010
IEEE
13 years 8 months ago
2010
IEEE
Abstract--Large high dimension datasets are of growing importance in many fields and it is important to be able to visualize them for understanding the results of data mining appro...
TEC
2002
13 years 7 months ago
2002
Abstract--This paper contains a modern vision of the parallelization techniques used for evolutionary algorithms (EAs). The work is motivated by two fundamental facts: first, the d...