Sciweavers

4325 search results - page 328 / 865
» Incremental computation with names
Sort
View
ICSOC
2007
Springer
16 years 29 days ago
Byzantine Fault Tolerant Coordination for Web Services Atomic Transactions
Abstract. In this paper, we present the mechanisms needed for Byzantine fault tolerant coordination of Web services atomic transactions. The mechanisms have been incorporated into ...
Wenbing Zhao
POLICY
2007
Springer
16 years 28 days ago
On Interoperable Trust Negotiation Strategies
Among the many works on trust negotiation, only a few deal with negotiation strategies. These works are tailored to specific frameworks—so their results cannot be extended to c...
Sabrina Baselice, Piero A. Bonatti, Marco Faella
IWNAS
2006
IEEE
16 years 25 days ago
TEA: Transmission Error Approximation for Distance Estimation between Two Zigbee Devices
This paper proposes a simple and costeffective method named Transmission Error Approximation (TEA) for estimating the distance between two Zigbee devices. The idea is to measure a...
Weijun Xiao, Yan Sun, Yinan Liu, Qing Yang
COMPGEOM
2006
ACM
16 years 23 days ago
An upper bound on the average size of silhouettes
It is a widely observed phenomenon in computer graphics that the size of the silhouette of a polyhedron is much smaller than the size of the whole polyhedron. This paper provides,...
Marc Glisse
ICRA
2005
IEEE
97views Robotics» more  ICRA 2005»
16 years 12 days ago
Singularity Loci of Spherical Parallel Mechanisms
Abstract— This paper presents the computation and representation of the Type 2 singularity loci of symmetric spherical parallel mechanisms based on a not-well-known intuitive ori...
Ilian A. Bonev, Clément Gosselin