1648 search results - page 155 / 330 » On the generation of bicliques of a graph |
CIKM
2010
Springer
13 years 8 months ago
2010
Springer
The cost of reachability query computation using traditional algorithms such as depth first search or transitive closure has been found to be prohibitive and unacceptable in mass...
SDM
2004
SIAM
13 years 11 months ago
2004
SIAM
Previous approaches for mining association rules generate large sets of association rules. Such sets are difficult for users to understand and manage. Here, the concept of a restri...
NAACL
2003
13 years 11 months ago
2003
This paper describes the construction of language choice models for the microplanning of discourse relations in a Natural Language Generation system that attempts to generate appr...
AIPS
2009
13 years 11 months ago
2009
A planning problem is k-dependent if each action has at most k pre-conditions on variables unaffected by the action. This concept is well-founded since k is a constant for all but...
IJAC
2007
13 years 10 months ago
2007
In this article we show that every group with a finite presentation satisfying one or both of the small cancellation conditions C (1/6) and C (1/4) − T (4) has the property that...