4041 search results - page 570 / 809 » time 2009 |
160
click to vote
IVA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Virtual humans are employed in many interactive applications, including (serious) games. Their motion should be natural and allow interaction with its surroundings and ot...
160
click to vote
IVA
2009
Springer
16 years 1 months ago
2009
Springer
Currently, applications that focus on providing conversations with virtual humans require extensive work to create robust conversational models. We present a new approach called Hu...
182
click to vote
IWOCA
2009
Springer
16 years 1 months ago
2009
Springer
The Feedback Vertex Set problem asks whether a graph contains q vertices meeting all its cycles. This is not a local property, in the sense that we cannot check if q vertices meet...
160
click to vote
IWOCA
2009
Springer
16 years 1 months ago
2009
Springer
The construction of covering arrays with the fewest rows remains a challenging problem. Most computational and recursive constructions result in extensive repetition of coverage. W...
205
click to vote
IWPEC
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We introduce the graph parameter boolean-width, related to the number of different unions of neighborhoods across a cut of a graph. For many graph problems this number is...