2597 search results - page 297 / 520 » On numbers of Davenport-Schinzel sequences |
158
click to vote
ARSCOM
2007
15 years 6 months ago
2007
A subset D of the vertex set V of a graph is called an open oddd dominating set if each vertex in V is adjacent to an odd number of vertices in D (adjacency is irreflexive). In t...
170
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Debugging is an important prerequisite for the wide-spread application of ontologies, especially in areas that rely upon everyday users to create and maintain knowledge b...
156
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
This paper presents an efficient method for approximation of temporal video data using linear Bezier fitting. For a given sequence of frames, the proposed method estimates the int...
CORR
2008
Springer
15 years 6 months ago
2008
Springer
The Karmarkar-Karp differencing algorithm is the best known polynomial time heuristic for the number partitioning problem, fundamental in both theoretical computer science and stat...
159
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract-- We consider code division multiple access communication over a binary input additive white Gaussian noise channel using random spreading. For a general class of symmetri...