9 search results - page 2 / 2 » An Object-Oriented Collection of Minimum Degree Algorithms |
ICALP
2001
Springer
13 years 10 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
IEEEIAS
2008
IEEE
14 years 19 days ago
2008
IEEE
: An intrusion detection system should support the operator of the system. Thus, in addition to producing alerts, it should allow for easy insertion of new detection algorithms. It...
COMPGEOM
1994
ACM
13 years 10 months ago
1994
ACM
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...
ICDE
2005
IEEE
14 years 7 months ago
2005
IEEE
Query processing in traditional information management systems has moved from an exact match model to more flexible paradigms allowing cooperative retrieval by aggregating the dat...