8728 search results - page 1403 / 1746 » On Reduct Construction Algorithms |
290
click to vote
POPL
2006
ACM
16 years 7 months ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
320
click to vote
POPL
2004
ACM
16 years 7 months ago
2004
ACM
Ensuring the correctness of multithreaded programs is difficult, due to the potential for unexpected interactions between concurrent threads. Much previous work has focused on det...
252
click to vote
SIGMOD
2008
ACM
16 years 7 months ago
2008
ACM
Today's query processing engines do not take advantage of the multiple occurrences of a relation in a query to improve performance. Instead, each instance is treated as a dis...
192
click to vote
SIGMOD
2002
ACM
16 years 6 months ago
2002
ACM
This paper addresses the problem of evaluating ranked top-? queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries...
194
click to vote
MOBIHOC
2007
ACM
16 years 6 months ago
2007
ACM
We address the problem of balancing the traffic load in multi-hop wireless networks. We consider a point-to-point communicating network with a uniform distribution of source-sink ...