Sciweavers

215 search results - page 24 / 43
» On the Linear Number of Matching Substrings
Sort
View
ECCC
2010
87views more  ECCC 2010»
13 years 5 months ago
Testing monotonicity of distributions over general partial orders
We investigate the number of samples required for testing the monotonicity of a distribution with respect to an arbitrary underlying partially ordered set. Our first result is a n...
Arnab Bhattacharyya, Eldar Fischer, Ronitt Rubinfe...
EUROGP
2005
Springer
114views Optimization» more  EUROGP 2005»
14 years 1 months ago
Repeated Patterns in Tree Genetic Programming
We extend our analysis of repetitive patterns found in genetic programming genomes to tree based GP. As in linear GP, repetitive patterns are present in large numbers. Size fair cr...
William B. Langdon, Wolfgang Banzhaf
SPIRE
2010
Springer
13 years 6 months ago
Counting and Verifying Maximal Palindromes
Abstract. A palindrome is a symmetric string that reads the same forward and backward. Let Pals(w) denote the set of maximal palindromes of a string w in which each palindrome is r...
Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayu...
ATAL
2009
Springer
14 years 2 months ago
Team competition
In a team competition, two participating teams have an equal number of players, and each team orders its players linearly based on their strengths. A mechanism then specifies how...
Pingzhong Tang, Yoav Shoham, Fangzhen Lin
DEBS
2009
ACM
13 years 11 months ago
MICS: an efficient content space representation model for publish/subscribe systems
One of the main challenges faced by content-based publish/subscribe systems is handling large amount of dynamic subscriptions and publications in a multidimensional content space....
Hojjat Jafarpour, Sharad Mehrotra, Nalini Venkatas...