Sciweavers

477 search results - page 19 / 96
» Removing even crossings
Sort
View
CCR
2006
112views more  CCR 2006»
13 years 7 months ago
The probe gap model can underestimate the available bandwidth of multihop paths
The Probe Gap Model (PGM) was proposed as a lightweight and fast available bandwidth estimation method. Measurement tools such as Delphi and Spruce are based on PGM. Compared to e...
Li Lao, Constantine Dovrolis, M. Y. Sanadidi
IWQOS
2005
Springer
14 years 1 months ago
Why QoS Will Be Needed in Metro Ethernets
Abstract. Emerging Metro Ethernets create new opportunities to converge data and telephony services. However, to connect legacy telephony equipment, networks have to meet customary...
Rainer Baumann, Ulrich Fiedler
GD
2003
Springer
14 years 22 days ago
Fixed-Location Circular-Arc Drawing of Planar Graphs
In this paper we consider the problem of drawing a planar graph using circular arcs as edges, given a one-to-one mapping between the vertices of the graph and a set of points in t...
Alon Efrat, Cesim Erten, Stephen G. Kobourov
SPAA
2003
ACM
14 years 23 days ago
Optimal fault-tolerant linear arrays
This paper proves that for every positive integers n and k, we can explicitly construct a graph G with n+O(k) vertices and maximum degree 3, such that even after removing any k ve...
Toshinori Yamada, Shuichi Ueno
CLEF
2005
Springer
14 years 1 months ago
Dictionary-Based Amharic-French Information Retrieval
We present four approaches to the Amharic - French bilingual track at CLEF 2005. All experiments use a dictionary based approach to translate the Amharic queries into French Bags-...
Atelach Alemu Argaw, Lars Asker, Rickard Cöst...