1552 search results - page 96 / 311 » On the Complexity of Constant Propagation |
142
click to vote
ICALP
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. We study the problem of determining the complexity of optimal comparison-based in-place sorting when the key length, k, is not a constant. We present the first algorithm...
130
click to vote
SIAMCOMP
1998
15 years 6 months ago
1998
We first present an algorithm that uses membership and equivalence queries to exactly identify a discretized geometric concept defined by the union of m axis-parallel boxes in d-...
161
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
The classical optical flow assumes that a feature point maintains constant brightness across the frames. For fluidtype motions such as smoke or clouds, the constant brightness ass...
166
click to vote
ITSL
2008
15 years 7 months ago
2008
In this paper we present a randomized complexity theoretic model for those epidemics propagated via short-distance close contact. We prove that the contact-based epidemics problems...
147
click to vote
INFOCOM
2005
IEEE
15 years 12 months ago
2005
IEEE
In this paper, we propose an O(1) complexity round robin scheduler, called Fair Round Robin (FRR), that provides good fairness and delay properties. Unlike existing O(1) complexit...