Sciweavers

8413 search results - page 289 / 1683
» Ordering Problem Subgoals
Sort
View
PR
2010
156views more  PR 2010»
15 years 4 months ago
The hyperbolic smoothing clustering method
It is considered the minimum sum-of-squares clustering problem. The mathematical modeling of this problem leads to a min − sum − min formulation which, in addition to its intr...
Adilson Elias Xavier
SIGPRO
2010
154views more  SIGPRO 2010»
15 years 4 months ago
UPRE method for total variation parameter selection
Total Variation (TV) regularization is a popular method for solving a wide variety of inverse problems in image processing. In order to optimize the reconstructed image, it is imp...
Youzuo Lin, Brendt Wohlberg, Hongbin Guo
HIS
2009
15 years 4 months ago
Scheduling Meta-Tasks in Distributed Heterogeneous Computing Systems: A Meta-Heuristic Particle Swarm Optimization Approach
Scheduling is a key problem in distributed heterogeneous computing systems in order to benefit from the large computing capacity of such systems and is an NP-complete problem. In ...
Hesam Izakian, Ajith Abraham, Václav Sn&aac...
ICMLA
2009
15 years 4 months ago
Structured Prediction with Relative Margin
In structured prediction problems, outputs are not confined to binary labels; they are often complex objects such as sequences, trees, or alignments. Support Vector Machine (SVM) ...
Pannagadatta K. Shivaswamy, Tony Jebara
TCS
2011
15 years 1 months ago
Communication complexity and intrinsic universality in cellular automata
Let F be a cellular automaton (CA). This paper establishes necessary conditions for F in order to be intrinsically universal. The central idea is to consider the communication com...
Eric Goles Chacc, Pierre-Etienne Meunier, Ivan Rap...