Sciweavers

20 search results - page 4 / 4
» Graph drawings with few slopes
Sort
View
CATS
2008
13 years 6 months ago
An ILP for the metro-line crossing problem
In this paper we consider a problem that occurs when drawing public transportation networks. Given an embedded graph G = (V, E) (e.g. the railroad network) and a set H of paths in...
Matthew Asquith, Joachim Gudmundsson, Damian Merri...
TCBB
2011
13 years 9 days ago
Visual Exploration across Biomedical Databases
Abstract—Though biomedical research often draws on knowledge from a wide variety of fields, few visualization methods for biomedical data incorporate meaningful cross-database e...
Michael D. Lieberman, Sima Taheri, Huimin Guo, Fat...
BMCBI
2007
134views more  BMCBI 2007»
13 years 5 months ago
Benchmarking natural-language parsers for biological applications using dependency graphs
Background: Interest is growing in the application of syntactic parsers to natural language processing problems in biology, but assessing their performance is difficult because di...
Andrew B. Clegg, Adrian J. Shepherd
KES
2010
Springer
13 years 3 months ago
Extracting a Keyword Network of Flood Disaster Measures
For rapid and effective recovery from a flood disaster, an anti-disaster headquarters must not only assess the extent of damage, but also possess overall knowledge of the possibl...
Motoki Miura, Mitsuhiro Tokuda, Daiki Kuwahara
NIPS
2001
13 years 6 months ago
Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering
Drawing on the correspondence between the graph Laplacian, the Laplace-Beltrami operator on a manifold, and the connections to the heat equation, we propose a geometrically motiva...
Mikhail Belkin, Partha Niyogi