16626 search results - page 372 / 3326 » Computing is a natural science |
193
click to vote
SIGDIAL
2010
15 years 4 months ago
2010
We describe an approach to improving the naturalness of a social dialogue system, Talkie, by adding disfluencies and other content-independent enhancements to synthesized conversa...
149
click to vote
MFCS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. The parameterized complexity classes of the W -hierarchy are usually defined as the problems reducible to certain natural complete problems by means of fixed-parameter ...
209
click to vote
FOCS
2002
IEEE
15 years 12 months ago
2002
IEEE
We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its...
200
click to vote
FOCS
2008
IEEE
15 years 8 months ago
2008
IEEE
In this paper we consider the following maximum budgeted allocation (MBA) problem: Given a set of m indivisible items and n agents; each agent i willing to pay bij on item j and w...
190
click to vote
CVPR
2007
IEEE
16 years 9 months ago
2007
IEEE
Image patches are fundamental elements for object modeling and recognition. However, there has not been a panoramic study of the structures of the whole ensemble of natural image ...