Sciweavers

170 search results - page 10 / 34
» On Metro-Line Crossing Minimization
Sort
View
APPROX
2004
Springer
136views Algorithms» more  APPROX 2004»
14 years 23 days ago
On the Crossing Spanning Tree Problem
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...
Vittorio Bilò, Vineet Goyal, R. Ravi, Mohit...
JGAA
2006
100views more  JGAA 2006»
13 years 7 months ago
Orthogonal Hypergraph Drawing for Improved Visibility
Visualization of circuits is an important research area in electronic design automation. One commonly accepted method to visualize a circuit aligns the gates to layers and uses or...
Thomas Eschbach, Wolfgang Günther, Bernd Beck...
CCCG
2007
13 years 8 months ago
Optimal Schedules for 2-guard Room Search
We consider the problem of searching a polygonal room with two guards starting at a specified door point. While maintaining mutual visibility and without crossing the door, the g...
Stephen Bahun, Anna Lubiw
BMCBI
2008
117views more  BMCBI 2008»
13 years 7 months ago
CrossHybDetector: detection of cross-hybridization events in DNA microarray experiments
Background: DNA microarrays contain thousands of different probe sequences represented on their surface. These are designed in such a way that potential cross-hybridization reacti...
Paolo Uva, Emanuele de Rinaldis
TREC
2001
13 years 8 months ago
Keep It Simple Sheffield - A KISS Approach to the Arabic Track
Sheffield's participation in the inaugural Arabic cross language track is described here. Our goal was to examine how well one could achieve retrieval of Arabic text with the...
Mark Sanderson, Asaad Alberair