Sciweavers

12257 search results - page 305 / 2452
» Analysis of Algorithms
Sort
View
PRL
2010
310views more  PRL 2010»
15 years 2 months 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
FAC
2010
140views more  FAC 2010»
15 years 1 months ago
From a domain analysis to the specification and detection of code and design smells
Code and design smells are recurring design problems in software systems that must be identified to avoid their possible negative consequences on development and maintenance. Conse...
Naouel Moha, Yann-Gaël Guéhéneu...
124
Voted
COMPGEOM
2010
ACM
15 years 9 months ago
Output-sensitive algorithm for the edge-width of an embedded graph
Let G be an unweighted graph of complexity n cellularly embedded in a surface (orientable or not) of genus g. We describe improved algorithms to compute (the length of) a shortest...
Sergio Cabello, Éric Colin de Verdiè...
ATAL
2009
Springer
15 years 10 months ago
Easy and hard coalition resource game formation problems: a parameterized complexity analysis
Coalition formation is a key topic in multi–agent systems (mas). Coalitions enable agents to achieve goals that they may not have been able to achieve independently, and encoura...
Tammar Shrot, Yonatan Aumann, Sarit Kraus
DEBU
2008
186views more  DEBU 2008»
15 years 4 months ago
A Survey of Collaborative Recommendation and the Robustness of Model-Based Algorithms
The open nature of collaborative recommender systems allows attackers who inject biased profile data to have a significant impact on the recommendations produced. Standard memory-...
Jeff J. Sandvig, Bamshad Mobasher, Robin D. Burke