5962 search results - page 891 / 1193 » Efficient Clustering for Orders |
196
click to vote
STOC
2005
ACM
16 years 7 months ago
2005
ACM
A celebrated 1976 theorem of Aumann asserts that honest, rational Bayesian agents with common priors will never "agree to disagree": if their opinions about any topic ar...
271
click to vote
VLDB
2004
ACM
16 years 7 months ago
2004
ACM
Ranking queries produce results that are ordered on some computed score. Typically, these queries involve joins, where users are usually interested only in the top-k join results....
179
click to vote
SIGMOD
2004
ACM
16 years 6 months ago
2004
ACM
The rich dependency structure found in the columns of real-world relational databases can be exploited to great advantage, but can also cause query optimizers--which usually assum...
192
click to vote
ICDE
2010
IEEE
16 years 6 months ago
2010
IEEE
A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicate...
160
Voted
DCC
2004
IEEE
16 years 6 months ago
2004
IEEE
In the discrete filtering problem, a data sequence over a finite alphabet is assumed to be corrupted by a discrete memoryless channel. The goal is to reconstruct the clean sequenc...