1215 search results - page 145 / 243 » Combinatorics |
112
Voted
COCOON
2009
Springer
15 years 10 months ago
2009
Springer
A honeynet is a portion of routed but otherwise unused address space that is instrumented for network traffic monitoring. It is an invaluable tool for understanding unwanted Intern...
102
Voted
COCOON
2009
Springer
15 years 10 months ago
2009
Springer
We show that a random walk on a tournament on n vertices finds either a sink or a 3-cycle in expected time O √ n · log n · log∗ n , that is, sublinear both in the size of th...
125
Voted
COCOON
2001
Springer
15 years 8 months ago
2001
Springer
: We consider the following problem. Given a polygon P, possibly with holes, and having n vertices, compute a pair of equal radius disks that do not intersect each other, are conta...
124
Voted
COCOON
1999
Springer
15 years 7 months ago
1999
Springer
Abstract: We propose a new approach for speeding up enumeration algorithms. The approach does not rely on data structures deeply, instead utilizes analysis of computation time. It ...
141
Voted
COCOON
1999
Springer
15 years 7 months ago
1999
Springer
Abstract. Hierarchical graphs are an important class of graphs for modelling many real applications in software and information visualization. In this paper, we shall investigate t...