1646 search results - page 158 / 330 » fast 2007 |
147
Voted
JCP
2007
15 years 4 months ago
2007
— In this paper, we study the dynamic version of the distributed all-pairs shortest paths problem. Most of the solutions given in the literature for this problem, either (i) work...
110
click to vote
JCT
2007
15 years 4 months ago
2007
In numerous positional games the identity of the winner is easily determined. In this case one of the more interesting questions is not who wins but rather how fast can one win. T...
107
click to vote
JCT
2007
15 years 4 months ago
2007
We show that to each graceful labelling of a path on 2s + 1 vertices, s ≥ 2, there corresponds a current assignment on a 3-valent graph which generates at least 22s cyclic orien...
124
click to vote
JIS
2007
15 years 4 months ago
2007
With the rapid increase in the use of databases, the problem of missing values inevitably arises. The techniques developed to effectively recover these missing values should be hi...
133
Voted
JSS
2007
15 years 4 months ago
2007
This paper reports security problems with improper implementations of an improved version of FEA-M (fast encryption algorithm for multimedia). It is found that an implementation-d...