Sciweavers

1172 search results - page 104 / 235
» Constructions of generalized Sidon sets
Sort
View
AMAST
1998
Springer
15 years 10 months ago
An Algebraic View of Program Composition
Abstract. We propose a general categorical setting for modeling program composition in which the call-by-value and call-by-name disciplines fit as special cases. Other notions of c...
Pietro Cenciarelli
IPPS
1998
IEEE
15 years 10 months ago
Fault-Tolerant Switched Local Area Networks
The RAIN (Reliable Array of Independent Nodes) project at Caltech is focusing on creating highly reliable distributed systems by leveraging commercially available personal compute...
Paul S. LeMahieu, Vasken Bohossian, Jehoshua Bruck
ALGORITHMICA
2000
87views more  ALGORITHMICA 2000»
15 years 6 months ago
Linear Size Binary Space Partitions for Uncluttered Scenes
We describe a new and simple method for constructing binary space partitions in arbitrary dimensions. We also introduce the concept of uncluttered scenes, which are scenes with a ...
Mark de Berg
161
Voted
BIOINFORMATICS
2010
109views more  BIOINFORMATICS 2010»
15 years 6 months ago
Phylogenetic networks do not need to be complex: using fewer reticulations to represent conflicting clusters
Phylogenetic trees are widely used to display estimates of how groups of species evolved. Each phylogenetic tree can be seen as a collection of clusters, subgroups of the species ...
Leo van Iersel, Steven Kelk, Regula Rupp, Daniel H...
CORR
2006
Springer
144views Education» more  CORR 2006»
15 years 6 months ago
The minimum linear arrangement problem on proper interval graphs
We present a linear time algorithm for the minimum linear arrangement problem on proper interval graphs. The obtained ordering is a 4-approximation for general interval graphs. 1 ...
Ilya Safro