10608 search results - page 114 / 2122 » Complexity of O'Hara's Algorithm |
PVLDB
2010
13 years 8 months ago
2010
Mashups integrate a set of Web-services and data sources, often referred to as mashlets. We study in this paper a common scenario where these mashlets are components of larger Web...
ICPR
2008
IEEE
14 years 11 months ago
2008
IEEE
The loss of information due to occlusion and other complications has been one of the main bottlenecks in the field of motion estimation. In this paper, we propose a novel motion e...
SAS
2009
Springer
14 years 10 months ago
2009
Springer
Abstract. While the tightest proven worst-case complexity for Andersen's points-to analysis is nearly cubic, the analysis seems to scale better on real-world codes. We examine...
ICPP
2009
IEEE
14 years 4 months ago
2009
IEEE
The multicore revolution is underway, bringing new chips introducing more complex memory architectures. Classical algorithms must be revisited in order to take the hierarchical me...
APPROX
2009
Springer
14 years 4 months ago
2009
Springer
The AND problem on t bits is a promise decision problem where either at most one bit of the input is set to 1 (NO instance) or all t bits are set to 1 (YES instance). In this note...