Sciweavers

982 search results - page 99 / 197
» Solving Steiner tree problems in graphs to optimality
Sort
View
ATAL
2008
Springer
15 years 2 months ago
Evaluating the performance of DCOP algorithms in a real world, dynamic problem
Complete algorithms have been proposed to solve problems modelled as distributed constraint optimization (DCOP). However, there are only few attempts to address real world scenari...
Robert Junges, Ana L. C. Bazzan
PPOPP
2005
ACM
15 years 6 months ago
A linear-time algorithm for optimal barrier placement
We want to perform compile-time analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the b...
Alain Darte, Robert Schreiber
92
Voted
ICCV
2009
IEEE
16 years 5 months ago
Optimizing Parametric Total Variation Models
One of the key factors for the success of recent energy minimization methods is that they seek to compute global solutions. Even for non-convex energy functionals, optimization ...
Petter Strandmark, Fredrik Kahl, Niels Chr. Overga...
82
Voted
CSJM
2006
76views more  CSJM 2006»
15 years 21 days ago
Graph Coloring using Peer-to-Peer Networks
The popularity of distributed file systems continues to grow in last years. The reasons they are preferred over traditional centralized systems include fault tolerance, availabili...
Adrian Iftene, Cornelius Croitoru
ICDM
2008
IEEE
175views Data Mining» more  ICDM 2008»
15 years 7 months ago
Overlapping Matrix Pattern Visualization: A Hypergraph Approach
In this work, we study a visual data mining problem: Given a set of discovered overlapping submatrices of interest, how can we order the rows and columns of the data matrix to bes...
Ruoming Jin, Yang Xiang, David Fuhry, Feodor F. Dr...