1531 search results - page 58 / 307 » Learning probabilistic models of the Web |
120
click to vote
NIPS
2004
15 years 7 months ago
2004
We describe how we used a data set of chorale harmonisations composed by Johann Sebastian Bach to train Hidden Markov Models. Using a probabilistic framework allows us to create a...
171
click to vote
ICDE
2010
IEEE
15 years 10 months ago
2010
IEEE
Mashups are situational applications that build data flows to link the contents of multiple Web sources. Often times, ranking the results of a mashup is handled in a materializethe...
168
click to vote
SIGIR
2006
ACM
16 years 4 days ago
2006
ACM
Evaluating user preferences of web search results is crucial for search engine development, deployment, and maintenance. We present a real-world study of modeling the behavior of ...
148
click to vote
ICCV
2003
IEEE
16 years 8 months ago
2003
IEEE
We present a method for unsupervised learning of classes of motions in video. We project optical flow fields to a complete, orthogonal, a-priori set of basis functions in a probab...
168
click to vote
ACL
2003
15 years 7 months ago
2003
Ordering information is a critical task for natural language generation applications. In this paper we propose an approach to information ordering that is particularly suited for ...