264 search results - page 41 / 53 » On the possibility of faster SAT algorithms |
111
Voted
SIGMOD
1997
ACM
15 years 2 months ago
1997
ACM
We study similarity queries for time series data where similarity is defined in terms of a set of linear transformations on the Fourier series representation of a sequence. We ha...
SIGGRAPH
1994
ACM
15 years 2 months ago
1994
ACM
FBRAM, a new form of dynamic random access memory that greatly accelerates the rendering of Z-buffered primitives, is presented. Two key concepts make this acceleration possible. ...
AVBPA
2003
Springer
15 years 1 months ago
2003
Springer
There are two main approaches to the problem of gender classification, Support Vector Machines (SVMs) and Adaboost learning methods, of which SVMs are better in correct rate but ar...
TASLP
2010
14 years 4 months ago
2010
We present an approach to music identification based on weighted finite-state transducers and Gaussian mixture models, inspired by techniques used in large-vocabulary speech recogn...
ACL
2012
13 years 15 days ago
2012
We address the problem of learning the mapping between words and their possible pronunciations in terms of sub-word units. Most previous approaches have involved generative modeli...