3758 search results - page 38 / 752 » A Complete Subsumption Algorithm |
ALDT
2009
Springer
14 years 2 months ago
2009
Springer
Judgment aggregation is a formal theory reasoning about how a group of agents can aggregate individual judgments on connected propositions into a collective judgment on the same pr...
SODA
2003
ACM
13 years 9 months ago
2003
ACM
We prove a lower bound of 0.3288 n 4¡ for the rectilinear crossing number cr(Kn) of a complete graph on n vertices, or in other words, for the minimum number of convex quadril...
SIGMOD
2006
ACM
14 years 7 months ago
2006
ACM
We study the problem of finding efficient equivalent viewbased rewritings of relational queries, focusing on query optimization using materialized views under the assumption that ...
APNOMS
2007
Springer
13 years 11 months ago
2007
Springer
Network topology discovery for the large IP networks is a very well studied area of research. Most of the previous work focus on improving the efficiency in terms of time and compl...
SIGIR
2009
ACM
14 years 2 months ago
2009
ACM
We consider experiments to measure the quality of a web search algorithm based on how much total time users take to complete assigned search tasks using that algorithm. We first ...