2778 search results - page 17 / 556 » Limit complexities revisited |
SIGIR
2010
ACM
15 years 1 months ago
2010
ACM
Several studies have found that the Cranfield approach to evaluation can report significant performance differences between retrieval systems for which little to no performance...
APPROX
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
ECCV
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. In this paper we introduce a principled approach to modeling the image brightness constraint for optical flow algorithms. Using a simple noise model, we derive a probabil...
SAC
2010
ACM
15 years 4 months ago
2010
ACM
The Sporadic Server (SS) overcomes the major limitations of other Resource Reservation Fixed Priority based techniques, but it also presents some drawbacks, mainly related to an i...
HPCC
2007
Springer
15 years 4 months ago
2007
Springer
Based on the renowned method of Bitton et al. (see [1]) we develop a concise but comprehensive analytical model for the well-known Binary Merge Sort, Bitonic Sort, Nested-Loop Join...