Sciweavers

393 search results - page 58 / 79
» The LCA Problem Revisited
Sort
View
358
Voted
PRL
2010
310views more  PRL 2010»
15 years 8 days ago
A Lagrangian Half-Quadratic approach to robust estimation and its applications to road scene analysis
We consider the problem of fitting linearly parameterized models, that arises in many computer vision problems such as road scene analysis. Data extracted from images usually cont...
Jean-Philippe Tarel, Pierre Charbonnier
CGO
2007
IEEE
15 years 8 months ago
On the Complexity of Register Coalescing
Memory transfers are becoming more important to optimize, for both performance and power consumption. With this goal in mind, new register allocation schemes are developed, which ...
Florent Bouchez, Alain Darte, Fabrice Rastello
JSAC
2010
122views more  JSAC 2010»
15 years 9 days ago
Scalable service migration in autonomic network environments
Abstract— Service placement is a key problem in communication networks as it determines how efficiently the user service demands are supported. This problem has been traditional...
Konstantinos Oikonomou, Ioannis Stavrakakis
INFOCOM
2007
IEEE
15 years 8 months ago
Performance Comparison of Detection Schemes for MAC Layer Misbehavior
— This paper revisits the problem of detecting greedy behavior in the IEEE 802.11 MAC protocol by evaluating the performance of two previously proposed schemes: DOMINO and the Se...
Alvaro A. Cárdenas, Svetlana Radosavac, Joh...
COMPGEOM
2004
ACM
15 years 7 months ago
New results on shortest paths in three dimensions
We revisit the problem of computing shortest obstacle-avoiding paths among obstacles in three dimensions. We prove new hardness results, showing, e.g., that computing Euclidean sh...
Joseph S. B. Mitchell, Micha Sharir