365 search results - page 48 / 73 » On the combinatorics of Galois numbers |
266
click to vote
COCOON
2011
Springer
13 years 11 months ago
2011
Springer
Motivated by a security problem in geographic information systems, we study the following graph theoretical problem: given a graph G, two special nodes s and t in G, and a number k...
COMPGEOM
2006
ACM
15 years 5 months ago
2006
ACM
Let S be a finite set of n + 3 points in general position in the plane, with 3 extreme points and n interior points. We consider triangulations drawn uniformly at random from the...
CORR
2008
Springer
14 years 12 months ago
2008
Springer
"THIS PAPER IS ELIGIBLE FOR THE STUDENT PAPER AWARD" Let Aq(n, d) be the maximum order (maximum number of codewords) of a q-ary code of length n and Hamming distance at l...
COCOON
2001
Springer
15 years 4 months ago
2001
Springer
In an undirected, 2-node connected graph G = (V, E) with positive real edge lengths, the distance between any two nodes r and s is the length of a shortest path between r and s in ...
110
click to vote
ICALP
2001
Springer
15 years 4 months ago
2001
Springer
Abstract. We consider the sequence comparison problem, also known as “hidden pattern” problem, where one searches for a given subsequence in a text (rather than a string unders...