Sciweavers

7064 search results - page 308 / 1413
» From States to Histories
Sort
View
ICLP
2010
Springer
15 years 10 months ago
Efficient Solving of Time-dependent Answer Set Programs
Answer set programs with time predicates are useful to model systems whose properties depend on time, like for example gene regulatory networks. A state of such a system at time po...
Timur Fayruzov, Jeroen Janssen, Dirk Vermeir, Chri...
SP
2010
IEEE
157views Security Privacy» more  SP 2010»
15 years 10 months ago
Bootstrapping Trust in Commodity Computers
Trusting a computer for a security-sensitive task (such as checking email or banking online) requires the user to know something about the computer’s state. We examine research ...
Bryan Parno, Jonathan M. McCune, Adrian Perrig
189
Voted
IJCAI
2007
15 years 8 months ago
Dynamically Weighted Hidden Markov Model for Spam Deobfuscation
Spam deobfuscation is a processing to detect obfuscated words appeared in spam emails and to convert them back to the original words for correct recognition. Lexicon tree hidden M...
Seunghak Lee, Iryoung Jeong, Seungjin Choi
AAAI
1996
15 years 8 months ago
Efficient Goal-Directed Exploration
If a state space is not completely known in advance, then search algorithms have to explore it sufficiently to locate a goal state and a path leading to it, performing therefore w...
Yury V. Smirnov, Sven Koenig, Manuela M. Veloso, R...
ICPR
2008
IEEE
16 years 8 months ago
Uncertainty minimization in multi-sensor localization systems using model selection theory
Belief propagation methods are the state-of-the-art with multi-sensor state localization problems. However, when localization applications have to deal with multi-modality sensors...
Andreas Koschan, David L. Page, Hamparsum Bozdogan...