Sciweavers

131 search results - page 21 / 27
» combinatorics 2004
Sort
View
MFCS
2004
Springer
14 years 3 months ago
A Generalization of Repetition Threshold
Brandenburg and (implicitly) Dejean introduced the concept of repetition threshold: the smallest real number α such that there exists an infinite word over a k-letter alphabet t...
Lucian Ilie, Pascal Ochem, Jeffrey Shallit
COMPGEOM
2004
ACM
14 years 3 months ago
On distinct distances from a vertex of a convex polygon
Given a set P of n points in convex position in the plane, we prove that there exists a point p ∈ P such that the number of distinct distances from p is at least (13n−6)/36 . ...
Adrian Dumitrescu
COCOON
2004
Springer
14 years 3 months ago
An Approximation Algorithm for Weighted Weak Vertex Cover Problem in Undirected Graphs
The problem of efficiently monitoring the network flow is regarded as the one to find out the minimum weighted weak vertex cover set for a given graph G = (V, E) with weight func...
Yong Zhang, Hong Zhu
CPM
2004
Springer
87views Combinatorics» more  CPM 2004»
14 years 3 months ago
A Trie-Based Approach for Compacting Automata
We describe a new technique for reducing the number of nodes and symbols in automata based on tries. The technique stems from some results on anti-dictionaries for data compression...
Maxime Crochemore, Chiara Epifanio, Roberto Grossi...
CPM
2004
Springer
156views Combinatorics» more  CPM 2004»
14 years 3 months ago
A Computational Model for RNA Multiple Structural Alignment.
Abstract. This paper addresses the problem of aligning multiple sequences of non-coding RNA genes. We approach this problem with the biologically motivated paradigm that scoring of...
Eugene Davydov, Serafim Batzoglou