Sciweavers

8582 search results - page 59 / 1717
» Here or There
Sort
View
COMBINATORICS
2006
102views more  COMBINATORICS 2006»
13 years 10 months ago
Identifying X-Trees with Few Characters
Previous work has shown the perhaps surprising result that, for any binary phylogenetic tree T , there is a set of four characters that define T . Here we deal with the general ca...
Magnus Bordewich, Charles Semple, Mike A. Steel
ENTCS
2006
166views more  ENTCS 2006»
13 years 10 months ago
Arrows, like Monads, are Monoids
Monads are by now well-established as programming construct in functional languages. Recently, the notion of "Arrow" was introduced by Hughes as an extension, not with o...
Chris Heunen, Bart Jacobs
CCR
2007
72views more  CCR 2007»
13 years 10 months ago
Report from the clean slate network research post-sigcomm 2006 workshop
Europe has often followed in the footsteps of US research, but here we are trying to lead in Clean Slate networking research, rather than Cleans late networking. This is a report ...
Jon Crowcroft, Peter B. Key
IJON
2008
95views more  IJON 2008»
13 years 10 months ago
A support vector machine with integer parameters
We describe here a method for building a support vector machine (SVM) with integer parameters. Our method is based on a branchand-bound procedure, derived from modern mixed intege...
Davide Anguita, Alessandro Ghio, Stefano Pischiutt...
COMBINATORICS
2007
68views more  COMBINATORICS 2007»
13 years 10 months ago
Compositions of Graphs Revisited
The idea of graph compositions, which was introduced by A. Knopfmacher and M. E. Mays, generalizes both ordinary compositions of positive integers and partitions of finite sets. ...
Aminul Huq