2944 search results - page 241 / 589 » Improving Bound Propagation |
185
click to vote
SRDS
2003
IEEE
16 years 15 days ago
2003
IEEE
In multipeer communication decentralised probabilistic protocols have received a lot of attention because of their robustness against faults in the communication traffic and thei...
184
click to vote
SBCCI
2003
ACM
16 years 15 days ago
2003
ACM
– We present a new architecture for signed multiplication which maintains the pure form of an array multiplier, exhibiting a much lower overhead than the Booth architecture. This...
230
click to vote
FGR
2002
IEEE
16 years 6 days ago
2002
IEEE
The aim of this work is to investigate how to exploit the temporal information in a video sequence for the task of face recognition. Following the approach in [11], we propose a p...
206
click to vote
SIGECOM
2010
ACM
16 years 2 days ago
2010
ACM
In this paper, we study the vaccination of graphs against the outbreak of infectious diseases, in the following natural model generalizing a model by Aspnes et al.: An infectious ...
179
click to vote
CPAIOR
2010
Springer
16 years 1 days ago
2010
Springer
This paper introduces the Increasing Nvalue constraint, which restricts the number of distinct values assigned to a sequence of variables so that each variable in the sequence is l...