627 search results - page 52 / 126 » Efficient Top-k Query Evaluation on Probabilistic Data |
163
click to vote
WSDM
2010
ACM
16 years 3 months ago
2010
ACM
As the Web provides rich data embedded in the immense contents inside pages, we witness many ad-hoc efforts for exploiting fine granularity information across Web text, such as We...
197
click to vote
SSDBM
2008
IEEE
16 years 16 days ago
2008
IEEE
There are a lot of application domains, e.g. sensor databases, traffic management or recognition systems, where objects have to be compared based on vague and uncertain data. Feat...
183
click to vote
DASFAA
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract. In many application domains, e.g. sensor databases, traffic management or recognition systems, objects have to be compared based on positionally and existentially uncert...
158
click to vote
SDM
2010
SIAM
15 years 7 months ago
2010
SIAM
Real-world relational data are seldom stationary, yet traditional collaborative filtering algorithms generally rely on this assumption. Motivated by our sales prediction problem, ...
137
click to vote
PVLDB
2008
15 years 5 months ago
2008
We study the efficient evaluation of top-k queries over data items, where the score of each item is dynamically computed by applying an item-specific function whose parameter valu...