Sciweavers

6365 search results - page 110 / 1273
» Fast Local Computation Algorithms
Sort
View
103
Voted
SAC
2010
ACM
15 years 9 months ago
Fast, flexible, and highly resilient genuine fifo and causal multicast algorithms
We study the fifo and causal multicast problem, two group-communication abstractions that deliver messages in an order consistent with their context. With fifo multicast, the co...
Nicolas Schiper, Fernando Pedone
109
Voted
STACS
2004
Springer
15 years 8 months ago
Matching Algorithms Are Fast in Sparse Random Graphs
We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability ...
Holger Bast, Kurt Mehlhorn, Guido Schäfer, Hi...
DCOSS
2006
Springer
15 years 6 months ago
The Robustness of Localization Algorithms to Signal Strength Attacks: A Comparative Study
In this paper, we examine several localization algorithms and evaluate their robustness to attacks where an adversary attenuates or amplifies the signal strength at one or more lan...
Yingying Chen, Konstantinos Kleisouris, Xiaoyan Li...
96
Voted
ICASSP
2010
IEEE
15 years 2 months ago
Fast structural similarity index algorithm
The development of real-time image quality assessment algorithms is an important direction on which little research has focused. This paper presents a design of real-time implemen...
Ming-Jun Chen, Alan Conrad Bovik
95
Voted
FLAIRS
2003
15 years 4 months ago
On the Computation of Local Interchangeability in Soft Constraint Satisfaction Problems
Freuder in (1991) defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently (2002), we extended the definition of interchangeability to Soft CSP...
Nicoleta Neagu, Stefano Bistarelli, Boi Faltings