6274 search results - page 964 / 1255 » From query complexity to computational complexity |
222
click to vote
SPAA
1993
ACM
15 years 11 months ago
1993
ACM
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...
192
click to vote
ACCV
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. In this paper, we address the problem of efficient human action detection with only one template. We choose the standard slidingwindow approach to scan the template video...
162
click to vote
ACISP
2007
Springer
15 years 11 months ago
2007
Springer
In this paper, we propose a new construction algorithm for finding differential paths of Round 1 of SHA-1 for use in the collision search attack. Generally, the differential path o...
205
click to vote
ACMSE
2007
ACM
15 years 11 months ago
2007
ACM
Intelligence analysis is difficult due to the volume and complexity of the data, as well as the subtlety of the connections that have to be made in order to identify threats. Info...
237
click to vote
CONEXT
2007
ACM
15 years 11 months ago
2007
ACM
The perception of future wireless mesh network (WMN) deployment and usage is rapidly evolving. WMNs are now being envisaged to provide citywide "last-mile" access for nu...