1552 search results - page 263 / 311 » On the Complexity of Constant Propagation |
112
click to vote
STOC
2005
ACM
15 years 5 months ago
2005
ACM
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...
102
click to vote
VIS
2007
IEEE
2007
IEEE
Modeling Perceptual Dominance Among Visual Cues in Multilayered Icon-based Scientific Visualizations
16 years 1 months ago
ization method is an abstract function that transforms a scientific dataset into a visual representation to facilitate data exploration. In turn, a visualization display is the vis...
107
click to vote
ICALP
2009
Springer
16 years 3 days ago
2009
Springer
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
MOBIHOC
2006
ACM
15 years 11 months ago
2006
ACM
This paper presents a distributed implementation of RAND, a randomized time slot scheduling algorithm, called DRAND. DRAND runs in O() time and message complexity where is the max...
STACS
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. A Boolean function on N variables is called evasive if its decision-tree complexity is N. A sequence Bn of Boolean functions is eventually evasive if Bn is evasive for al...