Sciweavers

136 search results - page 26 / 28
» Crossing and Weighted Crossing Number of Near-Planar Graphs
Sort
View
RIVF
2003
13 years 9 months ago
Airspace Sectorization By Constraint Programming
—In this paper we consider the Airspace Sectorization Problem (ASP) where airspace has to be partitioned into a number of sectors, each sector being assigned to a team of air tra...
Huy Trandac, Philippe Baptiste, Vu Duong
BMCBI
2010
115views more  BMCBI 2010»
13 years 7 months ago
Integration of multiple data sources to prioritize candidate genes using discounted rating system
Background: Identifying disease gene from a list of candidate genes is an important task in bioinformatics. The main strategy is to prioritize candidate genes based on their simil...
Yongjin Li, Jagdish Chandra Patra
JOI
2011
140views more  JOI 2011»
13 years 2 months ago
A bibliometric index based on the collaboration distance between cited and citing authors
The popular h-index used to measure scientific output can be described in terms of a pool of evaluated objects (the papers), a quality function on the evaluated objects (the numb...
Maria Bras-Amorós, Josep Domingo-Ferrer, Vi...
CLA
2007
13 years 9 months ago
An FDP-Algorithm for Drawing Lattices
In this work we want to discuss an algorithm for drawing line diagrams of lattices based on force directed placement (FDP). This widely used technique in graph drawing introduces f...
Christian Zschalig
KDD
2009
ACM
181views Data Mining» more  KDD 2009»
14 years 2 months ago
An exploration of climate data using complex networks
To discover patterns in historical data, climate scientists have applied various clustering methods with the goal of identifying regions that share some common climatological beha...
Karsten Steinhaeuser, Nitesh V. Chawla, Auroop R. ...