Sciweavers

67 search results - page 7 / 14
» Constructing Strictly Positive Families
Sort
View
AAAI
2006
13 years 9 months ago
Collective Construction Using Lego Robots
hibition: Extended Abstract Social insects, such as ants and termites, collectively build large and complex structures, with many individuals following simple rules and no centrali...
Crystal Schuil, Matthew Valente, Justin Werfel, Ra...
TIT
2008
86views more  TIT 2008»
13 years 7 months ago
Optimal Prefix Codes for Infinite Alphabets With Nonlinear Costs
Let P = {p(i)} be a measure of strictly positive probabilities on the set of nonnegative integers. Although the countable number of inputs prevents usage of the Huffman algorithm, ...
Michael B. Baer
ENTCS
2000
59views more  ENTCS 2000»
13 years 7 months ago
Building continuous webbed models for system F
We present here a large family of concrete models for Girard and Reynolds polymorphism (System F), in a non categorical setting. The family generalizes the construction of the mod...
Stefano Berardi, Chantal Berline
BMCBI
2007
130views more  BMCBI 2007»
13 years 8 months ago
HMM-ModE - Improved classification using profile hidden Markov models by optimising the discrimination threshold and modifying e
Background: Profile Hidden Markov Models (HMM) are statistical representations of protein families derived from patterns of sequence conservation in multiple alignments and have b...
Prashant K. Srivastava, Dhwani K. Desai, Soumyadee...
ICALP
2007
Springer
14 years 2 months ago
Parameterized Approximability of the Disjoint Cycle Problem
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...
Martin Grohe, Magdalena Grüber