Sciweavers

1136 search results - page 97 / 228
» Finding Small Holes
Sort
View
NETWORKING
2008
13 years 10 months ago
The Effect of Peer Selection with Hopcount or Delay Constraint on Peer-to-Peer Networking
We revisit the peer selection problem of finding the most nearby peer from an initiating node. The metrics to assess the closeness between peers are hopcount and delay, respectivel...
Siyu Tang, Huijuan Wang, Piet Van Mieghem
NIPS
2008
13 years 10 months ago
Bayesian Network Score Approximation using a Metagraph Kernel
Many interesting problems, including Bayesian network structure-search, can be cast in terms of finding the optimum value of a function over the space of graphs. However, this fun...
Benjamin Yackley, Eduardo Corona, Terran Lane
SODA
2008
ACM
106views Algorithms» more  SODA 2008»
13 years 10 months ago
Exact and efficient 2D-arrangements of arbitrary algebraic curves
We show how to compute the planar arrangement induced by segments of arbitrary algebraic curves with the Bentley-Ottmann sweep-line algorithm. The necessary geometric primitives r...
Arno Eigenwillig, Michael Kerber
BIOCOMP
2006
13 years 10 months ago
Study on Properties of Protein Folding Conformation Network
- Protein folding conformations take the form of networks, sets of conformations (vertices) joined together in pairs by links or edges. Protein folding conformation network is a co...
Nengchao Wang, Zhongjun Wang
CIIT
2004
131views Communications» more  CIIT 2004»
13 years 10 months ago
Effectiveness of rate-limiting in mitigating flooding DOS attacks
This paper investigates the effectiveness of rate-limiting in mitigating TCP-based flooding Denial of Service (DoS) attacks. Rate-limiting is used as a DoS defense mechanism to di...
Jarmo Mölsä