Sciweavers

730 search results - page 8 / 146
» Combinatorics of Monotone Computations
Sort
View
RECOMB
2002
Springer
14 years 7 months ago
Monotony of surprise and large-scale quest for unusual words
The problem of characterizing and detecting recurrent sequence patterns such as substrings or motifs and related associations or rules is variously pursued in order to compress da...
Alberto Apostolico, Mary Ellen Bock, Stefano Lonar...
JSYML
2010
71views more  JSYML 2010»
13 years 5 months ago
Limitwise monotonic functions, sets, and degrees on computable domains
We extend the notion of limitwise monotonic functions to include arbitrary computable domains. We then study which sets and degrees are support increasing (support strictly increas...
Asher M. Kach, Daniel Turetsky
CPM
2010
Springer
121views Combinatorics» more  CPM 2010»
14 years 8 days ago
Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks
Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, R...
COMBINATORICS
2002
102views more  COMBINATORICS 2002»
13 years 7 months ago
Computation in Coxeter Groups-I. Multiplication
An efficient and purely combinatorial algorithm for calculating products in arbitrary Coxeter groups is presented, which combines ideas of Fokko du Cloux and myself. Proofs are lar...
Bill Casselman
IPL
2006
86views more  IPL 2006»
13 years 7 months ago
Monotone circuits for monotone weighted threshold functions
Weighted threshold functions with positive weights are a natural generalization of unweighted threshold functions. These functions are clearly monotone. However, the naive way of ...
Amos Beimel, Enav Weinreb