1732 search results - page 45 / 347 » Sequences of Level 1, 2, 3, ..., k , .. |
152
click to vote
DLT
2008
15 years 7 months ago
2008
The classes of languages which are boolean combinations of languages of the form A a1A a2A . . . A a A , where a1, . . . , a A, k , for a fixed k 0, form a natural hierarchy wit...
168
click to vote
ISVLSI
2008
IEEE
16 years 17 days ago
2008
IEEE
We present methods to design programs or electronic circuits, for performing any operation on k registers of any sizes in a processor, in such a way that one uses no other working...
142
click to vote
WWW
2009
ACM
16 years 6 months ago
2009
ACM
In the origin detection problem an algorithm is given a set S of documents, ordered by creation time, and a query document D. It needs to output for every consecutive sequence of ...
166
click to vote
GC
2010
Springer
15 years 4 months ago
2010
Springer
In this paper, we give a sufficient condition for a graph to have a degree bounded spanning tree. Let n ≥ 1, k ≥ 3, c ≥ 0 and G be an n-connected graph. Suppose that for eve...
153
click to vote
ESA
2007
Springer
16 years 10 days ago
2007
Springer
Given a graph G = (V, E), a (d, k)-coloring is a function from the vertices V to colors {1, 2, . . . , k} such that any two vertices within distance d of each other are assigned di...