461 search results - page 50 / 93 » Practical polynomial factoring in polynomial time |
EURODAC
1994
IEEE
15 years 1 months ago
1994
IEEE
We consider a switch module routing problem for symmetric array FPGAs. The work is motivated by two applications. The rst is that of eciently evaluating switch module designs [8]...
AAAI
2006
14 years 11 months ago
2006
We present tractable, exact algorithms for learning actions' effects and preconditions in partially observable domains. Our algorithms maintain a propositional logical repres...
FLAIRS
2006
14 years 11 months ago
2006
Sensitivity analysis of Markovian models amounts to computing the constants in polynomial functions of a parameter under study. To handle the computational complexity involved, we...
AMC
2008
14 years 10 months ago
2008
This paper introduces a general framework for defining the entropy of a graph. Our definition is based on a local information graph and on information functionals derived from the...
174
click to vote
ICDE
2007
IEEE
15 years 11 months ago
2007
IEEE
Recent work has shown the necessity of considering an attacker's background knowledge when reasoning about privacy in data publishing. However, in practice, the data publishe...