686 search results - page 58 / 138 » On the General Applicability of Instruction-Set Randomizatio... |
112
Voted
VISAPP
2008
15 years 4 months ago
2008
Abstract. This article describes an algorithm for pose or motion estimation based on clustering of parameters in the six-dimensional pose space. The parameter samples are computed ...
184
click to vote
CVPR
2009
IEEE
16 years 10 months ago
2009
IEEE
Many computer vision problems can be formulated in
a Bayesian framework with Markov Random Field (MRF)
or Conditional Random Field (CRF) priors. Usually, the
model assumes that ...
102
Voted
SAC
2006
ACM
15 years 9 months ago
2006
ACM
Unstructured peer-to-peer lookup systems incur small constant overhead per single join or leave operation, and can easily support keyword searches. Hence, they are suitable for dy...
123
Voted
ICAI
2003
15 years 4 months ago
2003
Boolean satisfiability (SAT) is the canonical NP-complete problem that plays an important role in AI and has many practical applications in Computer Science in general. Boolean n...
147
click to vote
JMLR
2010
15 years 1 months ago
2010
The problem of computing a maximum a posteriori (MAP) configuration is a central computational challenge associated with Markov random fields. There has been some focus on “tr...