280 search results - page 16 / 56 » New Algorithms for Enumerating All Maximal Cliques |
JAL
2006
14 years 9 months ago
2006
We present a new algorithm, called LB-Triang, which computes minimal triangulations. We give both a straightforward O(nm0) time implementation and a more involved O(nm) time imple...
58
Voted
CIKM
2004
Springer
15 years 2 months ago
2004
Springer
This paper presents a unified utility framework for resource selection of distributed text information retrieval. This new framework shows an efficient and effective way to infer ...
JALC
2008
14 years 9 months ago
2008
A combinatorial channel is a set of pairs of words describing all the possible input-output channel situations. We introduce the concept "maximal error-detecting capability&q...
LATIN
2004
Springer
15 years 2 months ago
2004
Springer
Given a finite set V , and integers k ≥ 1 and r ≥ 0, denote by A(k, r) the class of hypergraphs A ⊆ 2V with (k, r)-bounded intersections, i.e. in which the intersection of a...
SIGMETRICS
2008
ACM
14 years 9 months ago
2008
ACM
In this paper, we study the problem of utility maximization in P2P systems, in which aggregate application-specific utilities are maximized by running distributed algorithms on P2...