9736 search results - page 38 / 1948 » How Fast Can We Compute Products |
133
click to vote
ECCV
2006
Springer
16 years 6 months ago
2006
Springer
Generalized Belief Propagation (gbp) has proven to be a promising technique for performing inference on Markov random fields (mrfs). However, its heavy computational cost and large...
149
click to vote
ACSAC
2010
IEEE
15 years 2 months ago
2010
IEEE
Instruction-set randomization (ISR) is a technique based on randomizing the "language" understood by a system to protect it from code-injection attacks. Such attacks wer...
173
click to vote
ICISC
2004
15 years 5 months ago
2004
In mining and integrating data from multiple sources, there are many privacy and security issues. In several different contexts, the security of the full privacy-preserving data mi...
178
click to vote
CPAIOR
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. In recent work binary decision diagrams (BDDs) were introduced as a technique for postoptimality analysis for integer programming. In this paper we show that much smaller...
131
click to vote
COLING
2010
14 years 11 months ago
2010
Because English is a low morphology language, current statistical parsers tend to ignore morphology and accept some level of redundancy. This paper investigates how costly such re...