Sciweavers

2192 search results - page 134 / 439
» Algorithms for Challenging Motif Problems
Sort
View
ISNN
2005
Springer
14 years 1 months ago
Multiple Parameter Selection for LS-SVM Using Smooth Leave-One-Out Error
In least squares support vector (LS-SVM), the key challenge lies in the selection of free parameters such as kernel parameters and tradeoff parameter. However, when a large number ...
Liefeng Bo, Ling Wang, Licheng Jiao
UAI
2004
13 years 9 months ago
Compact Value-Function Representations for Qualitative Preferences
We consider the challenge of preference elicitation in systems that help users discover the most desirable item(s) within a given database. Past work on preference elicitation foc...
Ronen I. Brafman, Carmel Domshlak, Tanya Kogan
PRL
2008
356views more  PRL 2008»
13 years 8 months ago
Improving image segmentation by gradient vector flow and mean shift
The classical gradient vector flow (GVF) method suffers from deficiency in the presence of other significant edges adjacent to the real boundary. In this paper, we propose an impr...
Tangwei Liu, Huiyu Zhou, Faquan Lin, Yusheng Pang,...
JUCS
2002
89views more  JUCS 2002»
13 years 8 months ago
Scheduling Tasks to a Team of Autonomous Mobile Service Robots in Indoor Enviroments
Abstract: This paper presents a complete system for scheduling transportation orders to a fleet of autonomous mobile robots in service environments. It consists of the autonomous m...
Hartmut Surmann, Antonio Morales
SAGT
2010
Springer
223views Game Theory» more  SAGT 2010»
13 years 6 months ago
Improved Lower Bounds on the Price of Stability of Undirected Network Design Games
Abstract. Bounding the price of stability of undirected network design games with fair cost allocation is a challenging open problem in the Algorithmic Game Theory research agenda....
Vittorio Bilò, Ioannis Caragiannis, Angelo ...