19866 search results - page 169 / 3974 » Computing all factorizations in *** |
144
click to vote
DCC
2001
IEEE
16 years 6 months ago
2001
IEEE
Recently, and contrary to the common belief, Rivest and Silverman argued that the use of strong primes is unnecessary in the RSA cryptosystem. This paper analyzes how valid this as...
182
click to vote
ICPP
2000
IEEE
15 years 11 months ago
2000
IEEE
Current VLSI technology allows more than two wiring layers and the number is expected to rise in future. In this paper, we show that, by designing VLSI layouts directly for an L-l...
169
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...
167
click to vote
EGC
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. In this article we consider objects for which we have a matrix of dissimilarities and we are interested in their links with covariates. We focus on state sequences for wh...
227
click to vote
CVPR
2012
IEEE
13 years 9 months ago
2012
IEEE
This paper addresses the discovery of activities and learns the underlying processes that govern their occurrences over time in complex surveillance scenes. To this end, we propos...