3913 search results - page 264 / 783 » complexity 2006 |
174
click to vote
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
In this paper we consider the problem of segmenting multiple rigid motions using multi?frame point correspondence data. The main idea of the method is to group points according to...
150
click to vote
ECCV
2006
Springer
16 years 8 months ago
2006
Springer
Abstract. We consider the problem of clustering data into k 2 clusters given complex relations -- going beyond pairwise -- between the data points. The complex n-wise relations ar...
142
click to vote
ISSAC
2009
Springer
16 years 17 days ago
2009
Springer
In this work we relate the deterministic complexity of factoring polynomials (over finite fields) to certain combinatorial objects, we call m-schemes, that are generalizations o...
188
click to vote
CRYPTO
2007
Springer
16 years 5 days ago
2007
Springer
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
149
click to vote
FSE
2007
Springer
16 years 5 days ago
2007
Springer
In this paper we present a cryptanalysis of a new 256-bit hash function, FORK-256, proposed by Hong et al. at FSE 2006. This cryptanalysis is based on some unexpected differential...