1215 search results - page 243 / 243 » Combinatorics |
TALG
2010
12 years 11 months ago
2010
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
CORR
2011
Springer
12 years 8 months ago
2011
Springer
Decomposition theorems in classical Fourier analysis enable us to express a bounded function in terms of few linear phases with large Fourier coefficients plus a part that is pseu...
FOSSACS
2011
Springer
12 years 7 months ago
2011
Springer
Traditional automata accept or reject their input, and are therefore Boolean. In contrast, weighted automata map each word to a value from a semiring over a large domain. The speci...
ICALP
2009
Springer
14 years 4 months ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
IANDC
2008
13 years 4 months ago
2008
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...