Sciweavers

4526 search results - page 310 / 906
» Algorithmic problems related to the Internet
Sort
View
UAI
2004
15 years 8 months ago
On Finding Minimal w-cutset
The complexity of a reasoning task over a graphical model is tied to the induced width of the underlying graph. It is well-known that the conditioning (assigning values) on a subs...
Bozhena Bidyuk, Rina Dechter
SPW
2001
Springer
15 years 11 months ago
Denial-of-Service, Address Ownership, and Early Authentication in the IPv6 World
In the IPv6 world, the IP protocol itself, i.e., IPv6, is used for a number of functions that currently fall beyond the scope of the IPv4 protocol. These functions include address ...
Pekka Nikander
WADS
2007
Springer
140views Algorithms» more  WADS 2007»
16 years 24 days ago
A Stab at Approximating Minimum Subadditive Join
Let (L, ∗) be a semilattice, and let c : L → [0, ∞) be monotone and increasing on L. We state the Minimum Join problem as: given size n sub-collection X of L and integer k w...
Staal A. Vinterbo
SODA
2004
ACM
115views Algorithms» more  SODA 2004»
15 years 8 months ago
Minimizing the stabbing number of matchings, trees, and triangulations
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
Sándor P. Fekete, Marco E. Lübbecke, H...
PODS
2008
ACM
123views Database» more  PODS 2008»
16 years 6 months ago
Evaluating rank joins with optimal cost
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
Karl Schnaitter, Neoklis Polyzotis