1688 search results - page 156 / 338 » The Complexity of Rationalizing Matchings |
170
click to vote
ESTIMEDIA
2006
Springer
15 years 9 months ago
2006
Springer
Nowadays, key characteristics of a processor's instruction set are only exploited in high-level languages by using inline assembly or compiler intrinsics. Inserting intrinsic...
129
click to vote
SODA
2004
ACM
15 years 7 months ago
2004
ACM
We close the gaps between known lower and upper bounds for the online partial-sums problem in the RAM and group models of computation. If elements are chosen from an abstract grou...
175
click to vote
CLEF
2010
Springer
15 years 7 months ago
2010
Springer
In this paper we present an approach to detect external plagiarism based on textual similarity. This is an efficient and precise method that can be applied over large sets of docum...
167
click to vote
IJCV
2008
15 years 6 months ago
2008
We present a real-time method for detecting deformable surfaces, with no need whatsoever for a priori pose knowledge. Our method starts from a set of wide baseline point matches be...
164
click to vote
PAMI
2006
15 years 5 months ago
2006
The performance of a fingerprint matching system is affected by the nonlinear deformation introduced in the fingerprint impression during image acquisition. This nonlinear deformat...