15073 search results - page 2874 / 3015 » Probabilistic algorithms for computing resultants |
100
click to vote
KDD
2001
ACM
16 years 2 months ago
2001
ACM
This paper considers the framework of the so-called "market basket problem", in which a database of transactions is mined for the occurrence of unusually frequent item s...
106
click to vote
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...
201
click to vote
SIGMOD
2007
ACM
16 years 1 months ago
2007
ACM
Complex queries often contain common or similar subexpressions, either within a single query or among multiple queries submitted as a batch. If so, query execution time can be imp...
220
click to vote
SIGMOD
2006
ACM
16 years 1 months ago
2006
ACM
Given a dataset P and a preference function f, a top-k query retrieves the k tuples in P with the highest scores according to f. Even though the problem is well-studied in convent...
124
click to vote
PERCOM
2006
ACM
16 years 1 months ago
2006
ACM
A smart home aims at building intelligence automation with a goal to provide its inhabitants with maximum possible comfort, minimize the resource consumption and thus overall cost...