303 search results - page 6 / 61 » Computing Minimal Spanning Subgraphs in Linear Time |
WDAG
2007
Springer
14 years 1 months ago
2007
Springer
Communication in networks suffers if a link fails. When the links are edges of a tree that has been chosen from an underlying graph of all possible links, a broken link even disco...
IS
2007
13 years 7 months ago
2007
As data mining techniques are being increasingly applied to non-traditional domains, existing approaches for finding frequent itemsets cannot be used as they cannot model the req...
STOC
2006
ACM
14 years 7 months ago
2006
ACM
Classes of graphs with bounded expansion have been introduced in [15], [12]. They generalize both proper minor closed classes and classes with bounded degree. For any class with b...
SEMWEB
2009
Springer
14 years 2 months ago
2009
Springer
Given two classifications, or lightweight ontologies, we compute the minimal mapping, namely the subset of all possible correspondences, called mapping elements, between them such ...
ARITH
2005
IEEE
14 years 1 months ago
2005
IEEE
We present a radix-2 online computational scheme for evaluating multinomials in a fixed-point number representation system. Its main advantage is that it can adapt to any evaluat...