Sciweavers

11160 search results - page 230 / 2232
» Incompleteness in a General Setting
Sort
View
TCS
2008
15 years 5 months ago
A unified approach to finding good stable matchings in the hospitals/residents setting
The hospitals/residents (HR) problem is a many-to-one generalization of the stable marriage (SM) problem. Researchers have been interested in variants of stable matchings that eit...
Christine Cheng, Eric McDermid, Ichiro Suzuki
ACL
2009
15 years 3 months ago
Setting Up User Action Probabilities in User Simulations for Dialog System Development
User simulations are shown to be useful in spoken dialog system development. Since most current user simulations deploy probability models to mimic human user behaviors, how to se...
Hua Ai, Diane J. Litman
IWOCA
2010
Springer
223views Algorithms» more  IWOCA 2010»
15 years 17 days ago
Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes
The maximum independent set problem is NP-complete for graphs in general, but becomes solvable in polynomial time when restricted to graphs in many special classes. The problem is ...
Konrad Dabrowski, Vadim V. Lozin, Haiko Mülle...
SCIA
2011
Springer
341views Image Analysis» more  SCIA 2011»
14 years 8 months ago
Interactive Image Segmentation Using Level Sets and Dempster-Shafer Theory of Evidence
Abstract. Variational frameworks based on level set methods are popular for the general problem of image segmentation. They combine different feature channels in an energy minimiz...
Björn Scheuermann, Bodo Rosenhahn
ICIP
2007
IEEE
16 years 7 months ago
Genetic Algorithms for Gielis Surface Recovery from 3D Data Sets
In this paper, we apply genetic algorithms to reconstruct Gielis surfaces from 3D data sets. The Levenberg-Marquardt method has been used as a standard for superquadrics recovery ...
Frédéric Truchetet, Sebti Foufou, Yo...