Sciweavers

409 search results - page 44 / 82
» Odd Crossing Number and Crossing Number Are Not the Same
Sort
View
ESA
2001
Springer
105views Algorithms» more  ESA 2001»
14 years 3 days ago
On the Parameterized Complexity of Layered Graph Drawing
We consider graph drawings in which vertices are assigned to layers and edges are drawn as straight line-segments between vertices on adjacent layers. We prove that graphs admittin...
Vida Dujmovic, Michael R. Fellows, Michael T. Hall...
GD
1998
Springer
13 years 11 months ago
Refinement of Orthogonal Graph Drawings
Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the quality of orthogonal drawings can be significantly improved with a ...
Janet M. Six, Konstantinos G. Kakoulis, Ioannis G....
CVPR
2008
IEEE
13 years 9 months ago
Probabilistic multi-tensor estimation using the Tensor Distribution Function
Diffusion weighted magnetic resonance (MR) imaging is a powerful tool that can be employed to study white matter microstructure by examining the 3D displacement profile of water m...
Alex D. Leow, Siwei Zhu, Katie McMahon, Greig I. d...
CRITIS
2007
13 years 9 months ago
An Analysis of Cyclical Interdependencies in Critical Infrastructures
Abstract In this paper we discuss the properties and algorithmic methods for the identification and classification of cyclical interdependencies in critical infrastructures based...
Nils Kalstad Svendsen, Stephen D. Wolthusen
LREC
2008
216views Education» more  LREC 2008»
13 years 9 months ago
Towards Semi Automatic Construction of a Lexical Ontology for Persian
Lexical ontologies and semantic lexicons are important resources in natural language processing. They are used in various tasks and applications, especially where semantic process...
Mehrnoush Shamsfard