3190 search results - page 136 / 638 » cans 2011 |
132
click to vote
ISNN
2011
Springer
14 years 3 months ago
2011
Springer
Abstract. Systems for keyword and non-linguistic vocalization detection in conversational agent applications need to be robust with respect to background noise and different speak...
186
click to vote
ISSAC
2011
Springer
14 years 3 months ago
2011
Springer
There are several algorithms for factoring in Z[x] which have a proven polynomial complexity bound such as Sch¨onhage of 1984, Belabas/Kl¨uners/van Hoeij/Steel of 2004, and vanH...
217
Voted
KER
2011
14 years 3 months ago
2011
Data mining has become a well established discipline within the domain of Artificial Intelligence (AI) and Knowledge Engineering (KE). It has its roots in machine learning and st...
154
click to vote
PODC
2011
ACM
14 years 3 months ago
2011
ACM
Dynamic memory management is a significant source of complexity in the design and implementation of practical concurrent data structures. We study how hardware transactional memo...
176
click to vote
PR
2011
14 years 3 months ago
2011
One of the main shortcomings of Markov chain Monte Carlo samplers is their inability to mix between modes of the target distribution. In this paper we show that advance knowledge ...