450 search results - page 8 / 90 » The Complexity of Computing Minimal Unidirectional Covering ... |
MICS
2010
14 years 10 months ago
2010
The conditional covering problem (CCP) aims to locate facilities on a graph, where the vertex set represents both the demand points and the potential facility locations. The proble...
109
click to vote
ICDM
2002
IEEE
15 years 4 months ago
2002
IEEE
Mining association rules may generate a large numbers of rules making the results hard to analyze manually. Pasquier et al. have discussed the generation of GuiguesDuquenne–Luxe...
AAAI
2008
15 years 2 months ago
2008
A recurring theme in AI and multiagent systems is how to select the "most desirable" elements given a binary dominance relation on a set of alternatives. Schwartz's...
CORR
2006
Springer
14 years 11 months ago
2006
Springer
In a previous paper we have suggested a number of ideas to attack circuit size complexity with cohomology. As a simple example, we take circuits that can only compute the AND of t...
AMW
2010
15 years 1 months ago
2010
A Data Warehouse (DW) is a data repository that integrates data from multiple sources and organizes the data according to a set of data structures called dimensions. Each dimension...