2412 search results - page 300 / 483 » Which Problems Have Strongly Exponential Complexity |
147
click to vote
CSFW
2008
IEEE
15 years 10 months ago
2008
IEEE
Abstract. The focus of work on information flow security has primarily been on definitions of security in asynchronous systems models. This paper considers systems with scheduler...
144
Voted
ICDE
2012
IEEE
13 years 6 months ago
2012
IEEE
—On a stream of two dimensional data items (x, y) where x is an item identifier, and y is a numerical attribute, a correlated aggregate query requires us to first apply a selec...
127
Voted
DLOG
2004
15 years 5 months ago
2004
We present algorithms based on truth-prefixed tableaux to solve both Concept Abduction and Contraction in ALN DL. We also analyze the computational complexity of the problems, sho...
195
Voted
DAC
2005
ACM
16 years 4 months ago
2005
ACM
Pointer analysis, a classic problem in software program analysis, has emerged as an important problem to solve in design automation, at a time when complex designs, specified in t...
135
Voted
IPPS
2009
IEEE
15 years 10 months ago
2009
IEEE
We introduce the problem of managing a FIFO buffer of bounded space, where arriving packets have dependencies among them. Our model is motivated by the scenario where large data f...