2680 search results - page 212 / 536 » The topology of the independence complex |
FEGC
2008
15 years 3 months ago
2008
We propose a way of extracting high-confidence association rules from datasets consisting of unlabeled trees. The antecedents are obtained through a computation akin to a hypergrap...
106
click to vote
ISPE
2003
15 years 2 months ago
2003
: Work to date on computational models of negotiation has focused almost exclusively on defining agreements consisting of one or a few independent issues. The negotiation involved ...
126
click to vote
SODA
2000
ACM
15 years 2 months ago
2000
ACM
A strategy is presented to find a set of points which yields a Conforming Delaunay tetrahedralization of a three-dimensional Piecewise-Linear Complex (PLC). This algorithm is nove...
114
click to vote
EUROPAR
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. In this paper we consider the problem of scheduling on computing platforms composed of several independent organizations, known as the Multi-Organization Scheduling Probl...
CORR
2007
Springer
15 years 1 months ago
2007
Springer
Existing syntactic grammars of natural languages, even with a far from complete coverage, are complex objects. Assessments of the quality of parts of such grammars are useful for t...