Sciweavers

409 search results - page 50 / 82
» Odd Crossing Number and Crossing Number Are Not the Same
Sort
View
BERTINORO
2005
Springer
14 years 1 months ago
Self-Management of Virtual Paths in Dynamic Networks
Abstract Virtual path management in dynamic networks poses a number of challenges related to combinatorial optimisation, fault and traffic handling. Ideally such management should ...
Poul E. Heegaard, Otto Wittner, Bjarne E. Helvik
ICCSA
2003
Springer
14 years 23 days ago
Computational Modelling of Particle Degradation in Dilute Phase Pneumatic Conveyors
The aim of this paper is to develop a mathematical model with the ability to predict particle degradation during dilute phase pneumatic conveying. A numerical procedure, based on a...
Pierre Chapelle, Nicholas Christakis, Hadi Abou-Ch...
GD
2009
Springer
14 years 5 days ago
Semi-bipartite Graph Visualization for Gene Ontology Networks
Abstract. In this paper we propose three layout algorithms for semibipartite graphs—bipartite graphs with edges in one partition—that emerge from microarray experiment analysis...
Kai Xu 0003, Rohan Williams, Seok-Hee Hong, Qing L...
INFOCOM
1996
IEEE
13 years 11 months ago
ARIES: A Rearrangeable Inexpensive Edge-Based On-Line Steiner Algorithm
In this paper, we propose and evaluate ARIES, a heuristic for updating multicast trees dynamically in large point-to-point networks. The algorithm is based on monitoring the accum...
Fred Bauer, Anujan Varma
SSD
1993
Springer
237views Database» more  SSD 1993»
13 years 11 months ago
A Small Set of Formal Topological Relationships Suitable for End-User Interaction
Topological relationships between spatial objects represent important knowledge that users of geographic information systems expect to retrieve from a spatial database. A di cult t...
Eliseo Clementini, Paolino Di Felice, Peter van Oo...