2526 search results - page 200 / 506 » A New Algorithm for Answer Set Computation |
195
click to vote
AINA
2007
IEEE
15 years 10 months ago
2007
IEEE
Bloom filter based algorithms have proven successful as very efficient technique to reduce communication costs of database joins in a distributed setting. However, the full potent...
182
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
Graph clustering has become ubiquitous in the study of relational data sets. We examine two simple algorithms: a new graphical adaptation of the k-medoids algorithm and the Girvan...
252
click to vote
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
Partial evaluation has recently proven an effective technique for evaluating Boolean XPath queries over a fragmented tree that is distributed over a number of sites. What left ope...
150
click to vote
WSDM
2009
ACM
16 years 1 months ago
2009
ACM
There has been considerable past work on efficiently computing top k objects by aggregating information from multiple ranked lists of these objects. An important instance of this...
184
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
We study the problem of scheduling permanent jobs on unrelated machines when the objective is to minimize the Lp norm of the machine loads. The problem is known as load balancing ...