Sciweavers

1557 search results - page 307 / 312
» Programming up to Congruence
Sort
View
IFE
2007
77views more  IFE 2007»
14 years 10 months ago
Drawing Subway Maps: A Survey
Abstract This paper deals with automating the drawing of subway maps. There are two features of schematic subway maps that make them different from drawings of other networks such...
Alexander Wolff
CACM
1998
81views more  CACM 1998»
14 years 10 months ago
Toward a Model of Type Inheritance
rigorous, and abstract— clearly defined and generally agreed—type inheritance model. To quote an article by Taivalsaari: “The basic idea of inheritance is quite simple ... [a...
C. J. Date, Hugh Darwen
MST
2002
128views more  MST 2002»
14 years 10 months ago
A Simple and Efficient Parallel Disk Mergesort
External sorting--the process of sorting a file that is too large to fit into the computer's internal memory and must be stored externally on disks--is a fundamental subroutin...
Rakesh D. Barve, Jeffrey Scott Vitter
BMCBI
2010
108views more  BMCBI 2010»
14 years 10 months ago
iGTP: A software package for large-scale gene tree parsimony analysis
Background: The ever-increasing wealth of genomic sequence information provides an unprecedented opportunity for large-scale phylogenetic analysis. However, species phylogeny infe...
Ruchi Chaudhary, Mukul S. Bansal, André Weh...
RSA
2008
123views more  RSA 2008»
14 years 10 months ago
Generating unlabeled connected cubic planar graphs uniformly at random
We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, ...
Manuel Bodirsky, Clemens Gröpl, Mihyun Kang