932 search results - page 59 / 187 » Where in the Wikipedia Is That Answer |
APPML
2006
13 years 9 months ago
2006
The purpose of the paper is to provide an answer to a long standing problem to compute the distance distribution among the nodes in a star graph, i.e., to compute the exact number...
FOCM
2008
13 years 9 months ago
2008
Let Fq be the finite field of q elements, where q = ph. Let f(x) be a polynomial over Fq in n variables with m non-zero terms. Let N(f) denote the number of solutions of f(x) = 0 ...
COMBINATORICA
2006
13 years 9 months ago
2006
We prove that the out-distance sequence {f+ (k)} of a vertex-transitive digraph of finite or infinite degree satisfies f+ (k + 1) f+ (k)2 for k 1, where f+ (k) denotes the numbe...
DM
2007
13 years 9 months ago
2007
A sequence is said to be k-automatic if the nth term of this sequence is generated by a finite state machine with n in base k as input. Regular sequences were first defined by ...
SEMWEB
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. We extend our recent work on evaluating incomplete reasoners by introducing strict testing bases. We show how they can be used in practice to identify ontologies and quer...