Sciweavers

9 search results - page 2 / 2
» An Object-Oriented Collection of Minimum Degree Algorithms
Sort
View
ICALP
2001
Springer
13 years 10 months ago
Approximating the Minimum Spanning Tree Weight in Sublinear Time
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 ...
Bernard Chazelle, Ronitt Rubinfeld, Luca Trevisan
IEEEIAS
2008
IEEE
14 years 19 days ago
Operator-Centric and Adaptive Intrusion Detection
: 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...
Ulf Larson, Stefan Lindskog, Dennis K. Nilsson, Er...
COMPGEOM
1994
ACM
13 years 10 months ago
Computing Envelopes in Four Dimensions with Applications
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...
Pankaj K. Agarwal, Boris Aronov, Micha Sharir
ICDE
2005
IEEE
120views Database» more  ICDE 2005»
14 years 7 months ago
Progressive Distributed Top k Retrieval in Peer-to-Peer Networks
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...
Wolf-Tilo Balke, Wolfgang Nejdl, Wolf Siberski, Uw...