1552 search results - page 104 / 311 » On the Complexity of Constant Propagation |
157
click to vote
ICASSP
2008
IEEE
16 years 25 days ago
2008
IEEE
In this paper, we consider online (sequential) portfolio selection in a competitive algorithm framework under transaction costs. We construct a sequential algorithm for portfolio ...
154
click to vote
PKC
2005
Springer
15 years 12 months ago
2005
Springer
Coppersmith, Franklin, Patarin, and Reiter show that given two RSA cryptograms xe mod N and (ax + b)e mod N for known constants a, b ∈ ZN , one can compute x in O(e log2 e) ZN -o...
182
click to vote
DCOSS
2007
Springer
15 years 10 months ago
2007
Springer
The problem we address in this paper is how to detect an intruder moving through a polygonal space that is equipped with a camera sensor network. We propose a probabilistic sensor ...
168
click to vote
SDM
2007
SIAM
15 years 7 months ago
2007
SIAM
Time series are difficult to monitor, summarize and predict. Segmentation organizes time series into few intervals having uniform characteristics (flatness, linearity, modality,...
222
click to vote
COMGEO
2002
ACM
15 years 6 months ago
2002
ACM
We present a quadtree-based decomposition of the interior of a polygon with holes. The complete decomposition yields a constant factor approximation of the minimum weight Steiner ...