Sciweavers

1299 search results - page 36 / 260
» Computing Minimal Diagnoses with Critical Set Algorithms
Sort
View
PPOPP
2005
ACM
15 years 3 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
TSMC
2008
136views more  TSMC 2008»
14 years 9 months ago
On 3-D Point Set Matching With MAE and SAE Cost Criteria
This paper deals with the problem of optimally matching two ordered sets of 3-D points by means of a rigid displacement. Contrary to the standard approach, where a sumof-squared-er...
Giuseppe C. Calafiore
CODES
2001
IEEE
15 years 1 months ago
RS-FDRA: a register sensitive software pipelining algorithm for embedded VLIW processors
The paper proposes a novel software-pipelining algorithm, Register Sensitive Force Directed Retiming Algorithm (RSFDRA), suitable for optimizing compilers targeting embedded VLIW ...
Cagdas Akturan, Margarida F. Jacome
ICDCS
2010
IEEE
14 years 11 months ago
Minimizing Probing Cost and Achieving Identifiability in Network Link Monitoring
Continuously monitoring the link performance is important to network diagnosis. Recently, active probes sent between end systems are widely used to monitor the link performance. I...
Qiang Zheng, Guohong Cao
SCALESPACE
2009
Springer
15 years 4 months ago
Geodesically Linked Active Contours: Evolution Strategy Based on Minimal Paths
The proposed method is related to parametric and geodesic active contours as well as minimal paths, in the context of image segmentation 1 . Our geodesically linked active contour ...
Julien Mille, Laurent D. Cohen