Sciweavers

479 search results - page 89 / 96
» cn 2008
Sort
View
ENDM
2008
118views more  ENDM 2008»
15 years 3 months ago
Number of Crossing-Free Geometric Graphs vs. Triangulations
We show that there is a constant > 0 such that, for any set P of n 5 points in general position in the plane, a crossing-free geometric graph on P that is chosen uniformly at...
Andreas Razen, Jack Snoeyink, Emo Welzl
CN
2008
117views more  CN 2008»
15 years 3 months ago
Broker-placement in latency-aware peer-to-peer networks
In large peer-to-peer (P2P) overlay networks, nodes usually share resources to support all kinds of applications. In such networks, a subset of the nodes may assume the role of br...
Pawel Garbacki, Dick H. J. Epema, Maarten van Stee...
CN
2008
108views more  CN 2008»
15 years 2 months ago
An approach to the identification of network elements composing heterogeneous end-to-end paths
Today's networks are becoming increasingly complex and the ability to effectively and efficiently operate and manage them is ever more challenging. Ways to provide end-to-end...
Alessio Botta, Antonio Pescapè, Giorgio Ven...
CCCG
2008
15 years 5 months ago
Minimum blocking sets of circles for a set of lines in the plane
A circle C is occluded by a set of circles C1, . . . , Cn if every line that intersects C also intersects at least one of the Ci, i = 1, . . . , n. In this paper, we focus on dete...
Natasa Jovanovic, Jan H. M. Korst, Augustus J. E. ...
JCSS
2008
62views more  JCSS 2008»
15 years 3 months ago
Maximal repetitions in strings
The cornerstone of any algorithm computing all repetitions in strings of length n in O(n) time is the fact that the number of maximal repetitions (runs) is linear. Therefore, the ...
Maxime Crochemore, Lucian Ilie