Sciweavers

686 search results - page 22 / 138
» On the General Applicability of Instruction-Set Randomizatio...
Sort
View
147
Voted
CODES
2003
IEEE
15 years 8 months ago
Design space exploration of a hardware-software co-designed GF(2m) galois field processor for forward error correction and crypt
This paper describes a hardware-software co-design approach for flexible programmable Galois Field Processing for applications which require operations over GF(2m ), such as RS an...
Wei Ming Lim, Mohammed Benaissa
SIGECOM
2008
ACM
138views ECommerce» more  SIGECOM 2008»
15 years 3 months ago
Generalized scoring rules and the frequency of coalitional manipulability
We introduce a class of voting rules called generalized scoring rules. Under such a rule, each vote generates a vector of k scores, and the outcome of the voting rule is based onl...
Lirong Xia, Vincent Conitzer
235
Voted
CVPR
2012
IEEE
13 years 5 months ago
A tiered move-making algorithm for general pairwise MRFs
A large number of problems in computer vision can be modeled as energy minimization problems in a markov random field (MRF) framework. Many methods have been developed over the y...
Vibhav Vineet, Jonathan Warrell, Philip H. S. Torr
EMSOFT
2005
Springer
15 years 9 months ago
Random testing of interrupt-driven software
Interrupt-driven embedded software is hard to thoroughly test since it usually contains a very large number of executable paths. Developers can test more of these paths using rand...
John Regehr
145
Voted
SODA
2007
ACM
76views Algorithms» more  SODA 2007»
15 years 4 months ago
An unbiased pointing operator for unlabeled structures, with applications to counting and sampling
We introduce a general method to count and randomly sample unlabeled combinatorial structures. The approach is based on pointing unlabeled structures in an “unbiased” way, i.e...
Manuel Bodirsky, Éric Fusy, Mihyun Kang, St...