2180 search results - page 381 / 436 » Algorithms for discovering bucket orders from data |
113
click to vote
WWW
2007
ACM
16 years 1 months ago
2007
ACM
Determining the user intent of Web searches is a difficult problem due to the sparse data available concerning the searcher. In this paper, we examine a method to determine the us...
109
Voted
KDD
2008
ACM
16 years 1 months ago
2008
ACM
Record label companies would like to identify potential artists as early as possible in their careers, before other companies approach the artists with competing contracts. The va...
168
click to vote
SIGMOD
2008
ACM
16 years 22 days ago
2008
ACM
With ever-increasing amounts of graph data from disparate sources, there has been a strong need for exploiting significant graph patterns with user-specified objective functions. ...
111
Voted
WSDM
2010
ACM
15 years 10 months ago
2010
ACM
This article describes an application of the partially observable Markov (POM) model to the analysis of a large scale commercial web search log. Mathematically, POM is a variant o...
108
click to vote
ESA
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. Kinetic data structures provide a framework for computing combinatorial properties of continuously moving objects. Although kinetic data structures for many problems have...