Sciweavers

499 search results - page 59 / 100
» On the Decay of Crossing Numbers
Sort
View
BMCBI
2008
156views more  BMCBI 2008»
13 years 8 months ago
Chromhome: A rich internet application for accessing comparative chromosome homology maps
Background: Comparative genomics has become a significant research area in recent years, following the availability of a number of sequenced genomes. The comparison of genomes is ...
Sridevi Nagarajan, Willem Rens, James Stalker, Ton...
CORR
2008
Springer
141views Education» more  CORR 2008»
13 years 8 months ago
Obfuscated Drawings of Planar Graphs
Given a planar graph G, we consider drawings of G in the plane where edges are represented by straight line segments (which possibly intersect). Such a drawing is specified by an i...
Mihyun Kang, Oleg Pikhurko, Alexander Ravsky, Math...
CORR
2007
Springer
84views Education» more  CORR 2007»
13 years 8 months ago
MMSE Optimal Algebraic Space-Time Codes
—Design of Space-Time Block Codes (STBCs) for Maximum Likelihood (ML) reception has been predominantly the main focus of researchers. However, the ML decoding complexity of STBCs...
G. Susinder Rajan, B. Sundar Rajan
ML
2008
ACM
156views Machine Learning» more  ML 2008»
13 years 7 months ago
On the connection between the phase transition of the covering test and the learning success rate in ILP
It is well-known that heuristic search in ILP is prone to plateau phenomena. An explanation can be given after the work of Giordana and Saitta: the ILP covering test is NP-complete...
Érick Alphonse, Aomar Osmani
JGAA
2000
85views more  JGAA 2000»
13 years 7 months ago
Techniques for the 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....