Sciweavers

2168 search results - page 97 / 434
» Using Approximation Hardness to Achieve Dependable Computati...
Sort
View
138
Voted
SIAMCOMP
2008
108views more  SIAMCOMP 2008»
15 years 3 months ago
A Primal-Dual Bicriteria Distributed Algorithm for Capacitated Vertex Cover
In this paper we consider the capacitated vertex cover problem which is the variant of vertex cover where each node is allowed to cover a limited number of edges. We present an ef...
Fabrizio Grandoni, Jochen Könemann, Alessandr...
160
Voted
IJCV
1998
103views more  IJCV 1998»
15 years 3 months ago
Dense Non-Rigid Motion Estimation in Sequences of Medical Images Using Differential Constraints
We describe a new method for computing the displacement vector field in time sequences of 2D or 3D images (4D data). The method is energy-minimizing on the space of correspondence...
Serge Benayoun, Nicholas Ayache
148
Voted
EUROPAR
2011
Springer
14 years 3 months ago
A Fully Empirical Autotuned Dense QR Factorization for Multicore Architectures
: Tuning numerical libraries has become more difficult over time, as systems get more sophisticated. In particular, modern multicore machines make the behaviour of algorithms hard ...
Emmanuel Agullo, Jack Dongarra, Rajib Nath, Stanim...
156
Voted
SIGMETRICS
2005
ACM
197views Hardware» more  SIGMETRICS 2005»
15 years 9 months ago
On the performance characteristics of WLANs: revisited
Wide-spread deployment of infrastructure WLANs has made Wi-Fi an integral part of today’s Internet access technology. Despite its crucial role in affecting end-to-end performan...
Sunwoong Choi, Kihong Park, Chong-kwon Kim
150
Voted
PEWASUN
2007
ACM
15 years 5 months ago
Worst-case lifetime computation of a wireless sensor network by model-checking
Wireless Sensor Network (WSN) technology is now mature enough to be used in numerous application domains. However, due to the restricted amount of energy usually allocated to each...
Laurent Mounier, Ludovic Samper, Wassim Znaidi