1615 search results - page 153 / 323 » Computer science and decision theory |
113
Voted
FOCS
2004
IEEE
15 years 4 months ago
2004
IEEE
Let p > 1 be any fixed real. We show that assuming NP RP, there is no polynomial time algorithm that approximates the Shortest Vector Problem (SVP) in p norm within a constant ...
103
click to vote
CAISE
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Parthood is a relation of fundamental importance in a number of disciplines including cognitive science, linguistics and conceptual modeling. However, one classical probl...
107
click to vote
LICS
2003
IEEE
15 years 6 months ago
2003
IEEE
We show that the first-order theory of structural subtyping of non-recursive types is decidable, as a consequence of a more general result on the decidability of term powers of d...
94
Voted
ATAL
2007
Springer
15 years 7 months ago
2007
Springer
We develop a new graphical representation for interactive partially observable Markov decision processes (I-POMDPs) that is significantly more transparent and semantically clear t...
EVOW
2009
Springer
15 years 4 months ago
2009
Springer
In this paper the node-level decision unit of a self-learning anomaly detection mechanism for office monitoring with wireless sensor nodes is presented. The node-level decision uni...